# Search results

• ===In group theory=== Perfect set: A set in a metric space that has no isolated points.
395 B (49 words) - 14:36, 9 June 2008
• | [[Groupprops:Main Page|Groupprops]] || Group theory || [[Groupprops:Special:Statistics|7200]] || December 2006 || beta || Occas | [[Topospaces:Main Page|Topospaces]] || Topology (point set, algebraic) || [[Topospaces:Special:Statistics|600]] || May 2007 || alpha |
3 KB (376 words) - 20:47, 9 October 2017
• ...tends to be confusing unless the logical expression under consideration is set off in a separate display. ...ackprime\backprime} \texttt{(~(~)~)} = \quad {}^{\prime\prime}\![/itex] or set off in a text display as follows:
41 KB (5,845 words) - 14:38, 6 November 2015
• '''Proof.''' Using the axiom set given in the entry for [[logical graphs]], Peirce's law may be proved in th * [[Relation theory]]
11 KB (1,526 words) - 16:14, 18 November 2015
• ...quite naturally in applications. This approach to relation theory, or the theory of relations, is distinguished from, though closely related to, its study f ...on requires three pieces of data, specifying the set $X,\!$ the set $Y,\!$ and a particular subset of their cartesian product $25 KB (3,665 words) - 21:05, 16 November 2015 • The ''[[boolean domain]]'' is the set [itex]\mathbb{B} = \{ 0, 1 \}.\!$ The third cartesian power of $\mathbb{B}\!$ is the set $\mathbb{B}^3 = \mathbb{B} \times \mathbb{B} \times \mathbb{B} = \{ (x 20 KB (2,655 words) - 21:25, 16 November 2015 • A '''sign relation''' is the basic construct in the theory of signs, also known as [[semeiotic]] or [[semiotics]], as developed by Cha ...precise enough, so long as one recognizes that its meaning in a particular theory of signs is given by a specific definition of what it means to be a sign. 58 KB (8,251 words) - 21:35, 15 November 2015 • ...gation [itex]\texttt{(} x_1, \ldots, x_k \texttt{)}\!$ indicates the set of points in $\mathbb{B}^k\!$ that differ from $x\!$ : A ''[[boolean domain]]'' $\mathbb{B}\!$ is a generic 2-element set, for example, $\mathbb{B} = \{ 0, 1 \},\!$ whose elements are in
22 KB (3,319 words) - 19:22, 6 November 2015
• ...alpha \in \Alpha \}\![/itex] with index $\alpha\!$ in the index set $\Alpha.\!$ * [[Relation theory]]
5 KB (572 words) - 04:18, 7 November 2015
• ...rmulas'' or ''wffs''), a distinguished subset of these expressions, plus a set of transformation rules that define a binary relation on the space of expre The set of axioms may be empty, a nonempty finite set, a countably infinite set, or given by axiom schemata. A formal grammar recursively defines the expr
17 KB (2,301 words) - 16:02, 7 November 2015
• ...st likely set by inverting the zodiac symbol for Aries('''&#9800;'''), but set in the text above by means of the ''curly wedge'' symbol. * [[Relation theory]]
9 KB (1,221 words) - 15:05, 5 November 2015
• A '''boolean domain''' $\mathbb{B}$ is a generic 2-element [[set]], say, $\mathbb{B} = \{ 0, 1 \},$ whose elements are interprete * [[Relation theory]]
5 KB (561 words) - 19:56, 5 November 2015
• ...$f : X \to \mathbb{B},$ where $X\!$ is an arbitrary set and where $\mathbb{B}$ is a [[boolean domain]]. * Kohavi, Zvi (1978), ''Switching and Finite Automata Theory'', 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978.
7 KB (806 words) - 21:16, 5 November 2015
• ...}\![/itex]&nbsp; The Table represents a relation $S\!$ over the set $P\!$ of people under discussion: The data of the Table are equivalent to the following set of ordered triples:
20 KB (2,925 words) - 17:10, 14 November 2015
• ...rdquo; approach to relations that is outlined in the article on [[relation theory]]. ...ms, in set theories of various kinds, and through a broadening of category theory from functions to relations in general.
65 KB (6,802 words) - 18:18, 14 November 2015
• ...tor'', the ''factor'', or the ''method of construction'', plus a specified set of other relations, called the ''faciens'', the ''ingredients'', or the ''m * [[Relation theory]]
5 KB (621 words) - 19:24, 14 November 2015
• ...reducer'', the ''method of reduction'', or the ''relational step'', plus a set of other relations, called the ''reduciens'' or the ''relational base'', e ...relations $L_j\!$ for values $j\!$ in a given index set $J\!$ and that this collection of data would suffice to fix the
29 KB (4,035 words) - 03:36, 15 November 2015
• ...arbitrary set and where $\mathbb{B}\!$ is a generic two-element set, typically $\mathbb{B} = \{ 0, 1 \} = \{ \mathrm{false}, \mathrm{true} * [[Relation theory]] 5 KB (626 words) - 18:10, 7 November 2015 • ...the aim of augmenting knowledge, resolving doubt, or solving a problem. A theory of inquiry is an account of the various types of inquiry and a treatment of ...ormative science]] of [[logic]]. In its inception, the pragmatic model or theory of inquiry was extracted by Peirce from its raw materials in classical logi 58 KB (7,676 words) - 22:36, 15 November 2015 • ...c]]', and tracking next the ways of thinking that led him to develop a ''[[theory of inquiry]]'', one that would be up to the task of saying 'how science wor ...ns denoting and objects denoted is critical to the discussion of Peirce's theory of signs. Wherever needed in the rest of this article, therefore, in order 24 KB (3,783 words) - 00:28, 16 November 2015 • ...both terms. The form ''semeiotic'' is often used to distinguish Peirce's theory, since it is less often used by other writers to denote their particular ap <p>The second kind of representations are such as are set up by a convention of men or a decree of God. Such are ''tallies'', ''prop 9 KB (1,162 words) - 21:30, 3 November 2015 • Regarded as a set, this triadic relation is the same thing as the binary operation: * [[Relation theory]] 16 KB (2,147 words) - 20:20, 4 November 2015 • ...s a ''[[parametric operator]]'' with ''parameter'' [itex]k\!$ in the set $\mathbb{N}\!$ of non-negative integers. * [[Relation theory]]
5 KB (618 words) - 04:12, 7 November 2015