Search results

• Tacit extension
  ...[[inverse]] [[operation]]s to the [[projection (mathematics)|projection]] of the Cartesian product onto the set in question, but the tacit extension is * [[Injection (mathematics)]]
  1 KB (181 words) - 13:28, 3 May 2019
• Entitative graph
  ...far as the [[propositional calculus|propositional or sentential]] aspects of logic are concerned. * [[Charles Sanders Peirce|Peirce, C.S.]], ''Collected Papers of Charles Sanders Peirce'', Vols. 1–6, [[Charles Hartshorne]] and [[Paul We
  2 KB (200 words) - 14:26, 5 September 2017
• Directory:The Wikipedia Point of View/Wikipedia & Political Agendas
  ...ionhood and national identity, about the rights and wrongs and the justice of a cause, about genocide and war. ...ted Wiki ''fact'', and itself a piece of history This brings up all sorts of moral and ethical issues.
  2 KB (325 words) - 01:28, 30 June 2011
• Logical matrix
  ...rix affords a matrix representation of a <math>k\!</math>-adic [[relation (mathematics)|relation]]. * [[Universe of discourse]]
  5 KB (541 words) - 16:12, 11 November 2015
• Relation construction
  ...', the ''factor'', or the ''method of construction'', plus a specified set of other relations, called the ''faciens'', the ''ingredients'', or the ''maki [[Relation composition]] and [[relation reduction]] are special cases of relation constructions.
  5 KB (621 words) - 19:18, 14 November 2015
• Boolean function
  ...case where <math>k = 0,\!</math> the function is simply a constant element of <math>\mathbb{B}.</math> ...y a basic role in questions of [[complexity theory]] as well as the design of circuits and chips for digital computers.
  5 KB (589 words) - 20:24, 5 November 2015
• Differential logic
  ...expressive capacity to describe change and diversity in logical universes of discourse. ...differential calculus of Leibniz and Newton augments the analytic geometry of Descartes.
  6 KB (662 words) - 22:28, 5 November 2015
• Boolean domain
  * [[Universe of discourse]] * [[Logic of relatives]]
  5 KB (561 words) - 19:54, 5 November 2015
• Parametric operator
  ...ath> in the '''parameter set''' <math>\Alpha\!</math> is an indexed family of operators <math>(\Omega_\alpha)_\Alpha = \{ \Omega_\alpha : \alpha \in \Alp * [[Universe of discourse]]
  5 KB (572 words) - 04:16, 7 November 2015
• Relative term
  ...ks, for example, &ldquo;lover&nbsp;of&nbsp;__&rdquo;, or &ldquo;giver&nbsp;of&nbsp;__&nbsp;to&nbsp;__&rdquo;. * [[Universe of discourse]]
  5 KB (599 words) - 20:20, 16 November 2015
• Multigrade operator
  ...' with ''parameter'' <math>k\!</math> in the set <math>\mathbb{N}\!</math> of non-negative integers. ...math> left tacit, as the appropriate application is implicit in the number of operands listed. Thus <math>\Omega (x_1, \ldots, x_k)\!</math> may be take
  5 KB (618 words) - 04:12, 7 November 2015
• Sole sufficient operator
  ...ate every operator in a specified class of operators.&nbsp; In the context of [[logic]], it is a logical operator that suffices to generate every [[boole * [[Universe of discourse]]
  5 KB (626 words) - 18:07, 7 November 2015
• Logical disjunction
  ...f two propositions, that produces a value of ''false'' if and only if both of its operands are false. The [[truth table]] of <math>p ~\operatorname{OR}~ q,</math> also written <math>p \lor q,\!</math>
  5 KB (656 words) - 00:40, 2 November 2015
• Logical conjunction
  ...of two propositions, that produces a value of ''true'' if and only if both of its operands are true. The [[truth table]] of <math>p ~\operatorname{AND}~ q,</math> also written <math>p \land q~\!</mat
  5 KB (658 words) - 02:00, 31 October 2015
• Descriptive science
  ...l knowledge, that seeks to discover what is true about a recognized domain of phenomena. * [[Universe of discourse]]
  5 KB (556 words) - 16:15, 4 November 2020
• Universe of discourse
  The term '''''universe of discourse''''' is generally attributed to Augustus De&nbsp;Morgan (1846).&n ...of our discourse are found, that field may properly be termed the universe of discourse. (Boole 1854/1958, p.&nbsp;42).</p>
  6 KB (702 words) - 19:14, 7 November 2015
• Logical equality
  ...al values, typically the values of two propositions, that produces a value of ''true'' if and only if both operands are false or both operands are true. The [[truth table]] of <math>p ~\operatorname{EQ}~ q,</math> also written <math>p = q,\!</math> <m
  5 KB (664 words) - 04:18, 4 November 2015
• Logical NNOR
  ...other words, it produces a value of ''false'' if and only if at least one of its operands is true. The [[truth table]] of <math>p ~\operatorname{NNOR}~ q,</math> also written <math>p \curlywedge q,
  5 KB (678 words) - 03:44, 5 November 2015
• Logical NAND
  ...n other words, it produces a value of ''true'' if and only if at least one of its operands is false. The [[truth table]] of <math>p ~\operatorname{NAND}~ q,</math> also written <math>p \stackrel{\cir
  5 KB (684 words) - 22:56, 4 November 2015
• Boolean-valued function
  A '''boolean-valued function''' is a function of the type <math>f : X \to \mathbb{B},</math> where <math>X\!</math> is an ar ...cteristic function, indicator function, predicate, or proposition. In all of these uses it is understood that the various terms refer to a mathematical
  7 KB (806 words) - 21:14, 5 November 2015
• Normative science
  ...ccumulated body of provisional knowledge, that seeks to discover good ways of achieving recognized aims, ends, goals, objectives, or purposes. * [[Universe of discourse]]
  5 KB (568 words) - 16:10, 4 November 2020
• Logical negation
  ...n, that produces a value of ''true'' when its operand is false and a value of ''false'' when its operand is true. The [[truth table]] of <math>\operatorname{NOT}~ p,</math> also written <math>\lnot p,\!</math> ap
  6 KB (729 words) - 14:16, 5 November 2015
• Exclusive disjunction
  ...o propositions, that produces a value of ''true'' just in case exactly one of its operands is true. The [[truth table]] of <math>p ~\operatorname{XOR}~ q,</math> also written <math>p + q~\!</math> o
  6 KB (728 words) - 01:45, 31 October 2015
• Logic of relatives
  ...s affords a distinctive perspective on the subject, even though all angles of approach must ultimately converge on the same formal subject matter. ...es, Resulting from an Amplification of the Conceptions of Boole's Calculus of Logic]]&rdquo;.
  7 KB (919 words) - 22:48, 10 November 2015
• Hypostatic abstraction
  ...cation'', ''reification'', and ''subjectal abstraction''.&nbsp; The object of discussion or thought thus introduced is termed a ''[[hypostatic object]]'' ...ntroduced [[Charles Sanders Peirce]] (CP&nbsp;4.235, &ldquo;[[The Simplest Mathematics]]&rdquo; (1902), in ''Collected Papers'', CP&nbsp;4.227&ndash;323).
  7 KB (915 words) - 18:58, 10 November 2015
• Continuous predicate
  ...cs)|relational predicate]] that arises as the limit of an iterated process of [[hypostatic abstraction]]. Here is one of Peirce's definitive discussions of the concept:
  8 KB (1,058 words) - 04:08, 10 November 2015
• Logic of information
  ...notation and connotation, or, in roughly equivalent terms, by the concepts of extension and comprehension. ...rvard University (1865) and the Lowell Institute (1866).&nbsp; Here is one of the starting points:
  8 KB (1,038 words) - 03:24, 16 November 2015
• User:Jon Awbrey/SYLLABUS
  * [[Universe of discourse]] * [[Logic of relatives]]
  6 KB (706 words) - 19:02, 9 June 2010
• Triadic relation
  ...multitude of forms is so terrific that I have usually shrunk from the task of enumerating them;&nbsp; and for the present purpose such an enumeration wou ...;">&mdash; [https://inquiryintoinquiry.com/2012/06/14/c-s-peirce-%e2%80%a2-of-triadic-being/ C.S.&nbsp;Peirce, <i>Collected Papers</i>, CP&nbsp;6.347]</p
  18 KB (2,519 words) - 18:02, 27 May 2020
• Frankie Pappas
  | num_employees_year = <!-- Year of num_employees data (if known) --> '''Frankie Pappas''' is the collective pseudonym for a group of creatives who collaborate on works ranging from architecture to art to code
  5 KB (662 words) - 06:41, 9 September 2020
• Worst of Wikipedia
  <big>'''The Worst of Wikipedia'''</big> ...ous content. Below are a series of links to a small sampling of the worst of Wikipedia's content, past and present, that are howlers, head-scratchers, o
  7 KB (1,034 words) - 18:08, 3 March 2013
• Peirce's law
  ==History== Here is Peirce's own statement and proof of the law:
  11 KB (1,526 words) - 04:14, 18 November 2015
• Ampheck
  ...ators is a ''[[sole sufficient operator]]'' for deriving or generating all of the other operators in the subject matter variously described as [[boolean ...<math>\mathbf{f}</math>, because it is necessarily false; while the value of <math>\underline {x \curlywedge y} \curlywedge \underline {x \curlywedge y}
  9 KB (1,221 words) - 15:04, 5 November 2015
• Truth table
  ...s <math>\{ \operatorname{false}, \operatorname{true} \}.</math> The names of the logical values, or ''truth values'', are commonly abbreviated in accord ...all representation of truth functions as boolean functions. The remainder of this article assumes the usual representation, taking the equations <math>\
  16 KB (2,190 words) - 03:25, 30 October 2015
• Zeroth order logic
  ...al calculus]], and sentential logic.&nbsp; The term serves to mark a level of abstraction in which the more inessential differences among these subjects ...type <math>\mathbb{B} \times \mathbb{B} \to \mathbb{B}</math> in a number of different languages for zeroth order logic.
  10 KB (1,357 words) - 16:04, 8 November 2015
• Logical implication
  ...ogical [[function (mathematics)|function]], a specific logical [[relation (mathematics)|relation]], and the various symbols that are used to denote this function ...concept of logical implication are expressed in ordinary language by means of linguistic forms like the following:
  16 KB (2,147 words) - 20:18, 4 November 2015
• Semeiotic
  ...adic]] [[sign relations]], along with ''semiotic'' and the plural variants of both terms. The form ''semeiotic'' is often used to distinguish Peirce's t ==Types of signs==
  9 KB (1,162 words) - 20:54, 3 November 2015
• Pragmatic maxim
  ...se, advising the addressee on an optimal way of &ldquo;attaining clearness of apprehension&rdquo;. ==Seven ways of looking at a pragmatic maxim==
  12 KB (1,764 words) - 04:32, 17 November 2015
• Relation (mathematics)
  In mathematics, a '''finitary relation''' is defined by one of the formal definitions given below. ...math>&rdquo; in a statement like <math>5 + 7 = 12\!</math> or the relation of ''order'' denoted by the sign &ldquo;<math>{<}\!</math>&rdquo; in a stateme
  20 KB (2,925 words) - 17:08, 14 November 2015
• Relation reduction
  ...ther relations, called the ''reduciens'' or the ''relational base'', each of which is properly simpler in a specified way than the relation under examin ...construction''' or '''relational reconstructibility''', since a useful way of stating the question is to ask whether the reductandum can be reconstructed
  29 KB (4,035 words) - 03:32, 15 November 2015
• Charles Sanders Peirce (Bibliography)
  ...g letters, manuscripts, publications, and Nachlass, along with a selection of secondary literature. * CE n, m = ''Writings of Charles S. Peirce: A Chronological Edition'', vol. n, page m.
  18 KB (2,307 words) - 21:04, 27 May 2015
• Minimal negation operator
  ...)~\!</math> is a logical connective that says &ldquo;just one false&rdquo; of its logical arguments.&nbsp; The first four cases are described below. ...in the form <math>\nu(),~\!</math> then it cannot be true that exactly one of the arguments is false, so <math>\nu() = \mathrm{false}.~\!</math>
  23 KB (3,337 words) - 13:54, 3 September 2017
• Relation theory
  ...inguished from, though closely related to, its study from the perspectives of abstract algebra on the one hand and formal logic on the other. Two definitions of the relation concept are common in the literature. Although it is usually
  25 KB (3,665 words) - 21:04, 16 November 2015
• Propositional calculus
  ...ter that is, up to somorphism, constituted by the structural relationships of mathematical objects called ''propositions''. ...s a set of transformation rules that define a binary relation on the space of expressions.
  17 KB (2,301 words) - 15:56, 7 November 2015
• Edward O Thorp
  ...he modern applications of [[probability theory]], including the harnessing of very small [[correlation]]s for reliable financial gain.{{Citation needed|d ...[wearable computer]].<ref name="wearcomp1">{{cite web |title=The Invention of the First Wearable Computer |url=http://www1.cs.columbia.edu/graphics/cours
  14 KB (2,003 words) - 12:17, 27 December 2017
• Cybernetics
  ..., in a ship, if a man were at liberty to do what he chose, but were devoid of mind and excellence in navigation (&#945;&#961;&#949;&#964;&#951;&#962; &#9 ...tics, characterizes cybernetics as &ldquo;the art of ensuring the efficacy of action&rdquo;.
  14 KB (1,827 words) - 18:48, 27 July 2016
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems
  &bull; [[Inquiry Driven Systems : Document History|Document History]] | align="right" | &mdash; Marcel Proust, ''In Search of Lost Time'', [Pro, 1.48]
  15 KB (1,597 words) - 12:00, 15 April 2017
• Relation composition
  ...omposition, or the composition of functions.&nbsp; The following treatment of relation composition takes the &ldquo;strongly typed&rdquo; approach to rel ...relative terms, 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
• Dynamics of inquiry
  ...f logical criticism of its inferences, must be aware of this determination of its ideas by previous ideas. (Peirce, "On Time and Thought", CE&nbsp;3, 68 ...approach, it is possible to see a question of articulation and a question of explanation:
  24 KB (3,783 words) - 00:25, 16 November 2015
• United States dollar
  ...s that use the $ symbol). The U.S. dollar is divided into 100 ([[Equality (mathematics)|equal]]) [[cent (currency)|cent]]s. ...ralreserve.gov/paymentsystems/coin/default.htm], which is an annual growth of about 6.6%.
  22 KB (3,436 words) - 13:39, 30 December 2017

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