Search results

MyWikiBiz, Author Your Legacy — Thursday May 09, 2024
Jump to navigationJump to search
Results 1 – 51 of 145
Advanced search

Search in namespaces:

  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  • ...[[projection (mathematics)|projection]] of the Cartesian product onto the set in question, but the tacit extension is the one that places no additional c [[Category:Category Theory]]
    1 KB (181 words) - 13:28, 3 May 2019
  • {{DISPLAYTITLE:Project : Pragmatic Theory Of Information}} ...properties of inquiry]]''. All of these ideas contribute to the pragmatic theory of inquiry.
    2 KB (267 words) - 17:20, 21 May 2010
  • [[Category:Graph Theory]] [[Category:Relation Theory]]
    475 bytes (59 words) - 20:10, 31 August 2017
  • * [[Relation theory]] * [[Truth theory]]
    3 KB (346 words) - 18:30, 27 May 2020
  • ...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:18, 14 November 2015
  • ...alpha \in \Alpha \}\!</math> with index <math>\alpha\!</math> in the index set <math>\Alpha.\!</math> * [[Relation theory]]
    5 KB (572 words) - 04:16, 7 November 2015
  • ...arbitrary set and where <math>\mathbb{B}\!</math> is a generic two-element set, typically <math>\mathbb{B} = \{ 0, 1 \} = \{ \mathrm{false}, \mathrm{true} * [[Relation theory]]
    5 KB (626 words) - 18:07, 7 November 2015
  • ...s a ''[[parametric operator]]'' with ''parameter'' <math>k\!</math> in the set <math>\mathbb{N}\!</math> of non-negative integers. * [[Relation theory]]
    5 KB (618 words) - 04:12, 7 November 2015
  • The relation <math>L_0</math> is the following set of four triples in <math>\mathbb{B}^3.</math> The relation <math>L_1</math> is the following set of four triples in <math>\mathbb{B}^3.</math>
    18 KB (2,519 words) - 18:02, 27 May 2020
  • A '''boolean domain''' <math>\mathbb{B}</math> is a generic 2-element [[set]], say, <math>\mathbb{B} = \{ 0, 1 \},</math> whose elements are interprete * [[Relation theory]]
    5 KB (561 words) - 19:54, 5 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) - 15:56, 7 November 2015
  • ...<math>f : X \to \mathbb{B},</math> where <math>X\!</math> is an arbitrary set and where <math>\mathbb{B}</math> 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:14, 5 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 <math>L_j\!</math> for values <math>j\!</math> in a given index set <math>J\!</math> and that this collection of data would suffice to fix the
    29 KB (4,035 words) - 03:32, 15 November 2015
  • ...}\!</math>&nbsp; The Table represents a relation <math>S\!</math> over the set <math>P\!</math> of people under discussion: The data of the Table are equivalent to the following set of ordered triples:
    20 KB (2,925 words) - 17:08, 14 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) - 20:54, 3 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 <math>X,\!</math> the set <math>Y,\!</math> and a particular subset of their cartesian product <math>
    25 KB (3,665 words) - 21:04, 16 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:04, 5 November 2015
  • ...(} x_1 \texttt{,} \ldots \texttt{,} x_k \texttt{)}~\!</math> indicates the set of points in <math>\mathbb{B}^k~\!</math> that differ from <math>x~\!</math : A ''[[boolean domain]]'' <math>\mathbb{B}~\!</math> is a generic 2-element set, for example, <math>\mathbb{B} = \{ 0, 1 \},~\!</math> whose elements are i
    23 KB (3,337 words) - 13:54, 3 September 2017
  • ...that subtle thinkers arrived at long before the dawn of modern information theory still have their uses in setting the stage of an introduction. ...nd are easily recognizable as staking out the two main axes of information theory, namely, the dual dimensions of ''information'' and ''control''. Roughly t
    20 KB (2,552 words) - 15:16, 2 March 2024
  • ...that subtle thinkers arrived at long before the dawn of modern information theory still have their uses in setting the stage of an introduction. ...nd are easily recognizable as staking out the two main axes of information theory, namely, the dual dimensions of ''information'' and ''control''. Roughly t
    20 KB (2,557 words) - 15:36, 5 November 2020
  • ...that subtle thinkers arrived at long before the dawn of modern information theory still have their uses in setting the stage of an introduction. ...nd are easily recognizable as staking out the two main axes of information theory, namely, the dual dimensions of ''information'' and ''control''. Roughly t
    20 KB (2,560 words) - 14:10, 29 October 2016
  • ===Basic Notions of Group Theory=== ===Basic Notions of Formal Language Theory===
    15 KB (1,597 words) - 12:00, 15 April 2017
  • ...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:25, 16 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) - 04:14, 18 November 2015
  • ...operations ''f'':&nbsp;''X''<sup>''n''</sup>&rarr;''X'' on a ''k''-element set ''X'', there are therefore 2<sup>2</sup><sup><sup>''n''</sup></sup> ''n''-a ...operations ''f'':&nbsp;''X''<sup>''n''</sup>&rarr;''X'' on a ''k''-element set ''X'', there are therefore 2<sup>2</sup><sup><sup>''n''</sup></sup> ''n''-a
    46 KB (7,067 words) - 04:10, 22 May 2010
  • ...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:14, 14 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,260 words) - 03:40, 21 November 2016
  • '''''Pragmatic theory of truth''''' refers to those accounts, definitions, and theories of the co Pragmatic theories of truth enter on a stage that was set by the philosophies of former ages, with special reference to the [[Ancient
    33 KB (4,907 words) - 04:32, 22 September 2014
  • Linear Topics. The Differential Theory of Qualitative Equations One finds discussed there the notion of a "polymorphous set". Such a set
    73 KB (6,208 words) - 04:08, 11 December 2016
  • Regarded as a set, this triadic relation is the same thing as the binary operation: * [[Relation theory]]
    16 KB (2,147 words) - 20:18, 4 November 2015
  • ...al propositional calculus''' is a [[propositional calculus]] extended by a set of terms for describing aspects of change and difference, for example, proc ...es the same universe of discourse and extends the basis of discussion to a set of two qualities, <math>\{ q, \mathrm{d}q \}.\!</math> In parallel fashion
    158 KB (22,468 words) - 03:24, 27 December 2016
  • �03[13:10] * Set by derp!~omg@bas7-montrealak-1128544932.dsl.bell.ca on Sun Oct 23 20:29:19 [13:46] <Ironholds> the problem with this is it means there's now no popular theory for why some people who do it are mean
    22 KB (2,834 words) - 04:49, 24 January 2015
  • Another possibility was that Flight 5481 encountered wake turbelence, the theory was backed-up when investigators discovered a Bombardier CRJ took off earli ...nbuckle]]s controlling [[tension]] on the cables to the elevators had been set incorrectly, resulting in insufficient elevator travel, leading to the pilo
    8 KB (1,110 words) - 19:53, 16 March 2009
  • the graphs that are called "cacti" and "conifers" in graph theory, Let V(G) be the set of nodes in a graph G and let L be a set of identifiers.
    94 KB (8,938 words) - 22:12, 9 December 2015
  • I've been meaning to get back to Peirce's theory of information, because I believe that it contains a yet-to-be-tapped poten That's a very rough sketch of just one aspect of Peirce's theory, but we can refine it as we go. The next order of business, though, is to
    73 KB (8,310 words) - 00:36, 27 April 2017
  • ...C.S. Peirce's treatment of analogy, placing it in relation to his overall theory of inquiry. The first order of business is to introduce the three fundamen ====Version 2. &ldquo;A Theory of Probable Inference&rdquo; (1883)====
    106 KB (13,991 words) - 18:45, 18 March 2020
  • A '''logical graph''' is a [[graph theory|graph-theoretic]] structure in one of the systems of graphical [[syntax]] t ...tends to be confusing unless the logical expression under consideration is set off in a separate display.
    42 KB (5,905 words) - 21:49, 22 May 2010
  • | Let <math>P\!</math> be the set of values <math>\{ \texttt{(} p \texttt{)},~ p \} ~=~ \{ \operatorname{not} | Let <math>Q\!</math> be the set of values <math>\{ \texttt{(} q \texttt{)},~ q \} ~=~ \{ \operatorname{not}
    127 KB (18,875 words) - 13:28, 10 December 2014
  • ...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:34, 15 November 2015
  • 1. Let X be the set of values {(x), x} = {not x, x}. 2. Let Y be the set of values {(y), y} = {not y, y}.
    134 KB (14,931 words) - 13:30, 5 December 2014
  • ...s our story right up to the present time frame, as mathematical [[category theory]], a formalism that many mathematicians regard as the natural language of c ...tury is characterized by a predominant interest in [[formal logic]], [[set theory]], and foundational issues.
    73 KB (10,917 words) - 19:48, 6 September 2017
  • ...tends to be confusing unless the logical expression under consideration is set off in a separate display. ...ackprime\backprime} \texttt{( ( ) )} = \quad {}^{\prime\prime}\!</math> or set off in a text display as follows:
    41 KB (5,845 words) - 14:26, 6 November 2015
  • ...ntial propositional calculus is a [[propositional calculus]] extended by a set of terms for describing aspects of change and difference, for example, proc | Let <math>P\!</math> be the set of values <math>\{ \texttt{(} p \texttt{)},~ p \} ~=~ \{ \mathrm{not}~ p,~
    131 KB (20,198 words) - 15:38, 2 December 2015
  • ...invented by [[Charles Babbage]] as part of his [[difference engine]]. The theory that is the basis for most modern software was first proposed by [[Alan Tur ...s is sometimes called a "loop." Often, one instruction may "call" another set of instructions that are defined in some other program or [[module (program
    14 KB (2,076 words) - 13:33, 31 October 2012
  • ...proach the story problem, a roughly realistic representation of a concrete set of circumstances, with the aim of abstracting the appropriate general formu ...her hand, is a type of formal object that is treated in the mathematical ''theory of relations''. There is of course an intimate relationship between the tw
    74 KB (11,616 words) - 23:56, 21 May 2010
  • ...tor for [[Linux]] on POWER: A tool that provides users of Linux on Power a set of performance models for IBM's POWER processors. ...=Publisher: Prentice Hall PTR| id= ISBN 0-13-019469-7|}}</ref> and a third theory is that it comes from the fact that IBM executives wore blue suits.<ref nam
    27 KB (3,819 words) - 03:29, 16 May 2010
  • ...ken, forward course by following steps that are never unsure. Acquiring a theory of inquiry is not, in short, a purely deductive exercise. ...o positive proof can arise from so negative a recommendation. Acquiring a theory of inquiry is not, in sum, a purely inductive exercise.
    92 KB (15,197 words) - 14:40, 24 August 2017
  • ...hat one might compile a theory from axioms without knowing what either the theory or the axioms were about &mdash; and the best way to sum up the state of in ...hing on faith. Thus we engage the ''denotative semantics'' or the ''model theory'' of these extremely simple programs that we call ''propositions''.
    59 KB (5,442 words) - 19:40, 8 November 2016
  • ...d on the pragmatic theory of inquiry and its relationship to the pragmatic theory of signs. * Next, I will select mathematical systems theory as an indispensable tool, both for the analysis of inquiry itself and for t
    121 KB (16,341 words) - 04:34, 30 October 2015
  • ...ntial propositional calculus is a [[propositional calculus]] extended by a set of terms for describing aspects of change and difference, for example, proc | Let <math>X\!</math> be the set of values <math>\{ \texttt{(} x \texttt{)},~ x \} ~=~ \{ \mathrm{not}~ x,~
    145 KB (19,916 words) - 19:32, 11 December 2014

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)