Search results

• Tacit extension
  ...ons, all of which serve as [[inverse]] [[operation]]s to the [[projection (mathematics)|projection]] of the Cartesian product onto the set in question, but the ta * [[Injection (mathematics)]]
  1 KB (181 words) - 13:28, 3 May 2019
• Relation type
  In [[logic]] and [[mathematics]] generally, and in the [[theory of relations]] specifically, relations fal * [[Category theory]]
  847 bytes (100 words) - 17:20, 19 May 2007
• Null graph
  The '''null graph''' or the '''empty graph''' is the [[graph (mathematics)|graph]] with no points and no lines. [[Category:Combinatorics]]
  475 bytes (59 words) - 20:10, 31 August 2017
• Logic
  [[Category:Computer Science]] [[Category:Formal Sciences]]
  353 bytes (41 words) - 13:30, 2 July 2009
• Formal science
  ...antly concerned with ''[[abstract]] [[form]]'', for instance, [[logic]], [[mathematics]], and the theoretical branches of [[computer science]], [[information theo * [[Abstraction (mathematics)|Abstraction in mathematics]]
  1 KB (134 words) - 20:10, 21 August 2009
• Integer sequence
  [[Category:Combinatorics]] [[Category:Mathematics]]
  254 bytes (32 words) - 19:58, 25 May 2007
• Grounded relation
  * [[Relation (mathematics)|Relation]] [[Category:Logic]]
  1 KB (177 words) - 02:20, 16 February 2008
• The Simplest Mathematics
  ...es the subject of the paper as “certain extremely simple branches of mathematics which, owing to their utility in logic, have to be treated in considerable * Peirce, C.S. (1902), “The Simplest Mathematics”, MS dated January–February 1902, intended as Chapter 3 of
  1 KB (177 words) - 15:35, 11 November 2015
• Prescisive abstraction
  ...given by [[Charles Sanders Peirce]] (CP 4.235, “[[The Simplest Mathematics]]” (1902), in ''Collected Papers'', CP 4.227–393). [[Category:Charles Sanders Peirce]]
  1,006 bytes (118 words) - 19:10, 10 November 2015
• Entitative graph
  An '''entitative [[graph (mathematics)|graph]]''' is an element of the [[graph theory|graphical]] [[syntax]] for ...Qualitative Logic", MS 736 (c. 1886), pp. 101–115 in ''The New Elements of Mathematics by Charles S. Peirce, Volume 4, Mathematical Philosophy'', [[Carolyn Eisele
  2 KB (200 words) - 14:26, 5 September 2017
• Hypostatic object
  [[Category:Charles Sanders Peirce]] [[Category:Inquiry]]
  527 bytes (64 words) - 18:44, 10 November 2015
• Logic of Relatives (1883)
  [[Category:Formal Languages]] [[Category:Formal Sciences]]
  2 KB (252 words) - 02:12, 7 July 2008
• Logic of Relatives (1870)
  [[Category:Formal Languages]] [[Category:Formal Sciences]]
  2 KB (280 words) - 02:10, 7 July 2008
• Logic Syllabus
  [[Category:Boolean algebra]] [[Category:Boolean functions]]
  3 KB (346 words) - 18:30, 27 May 2020
• Logical matrix
  ...rix affords a matrix representation of a <math>k\!</math>-adic [[relation (mathematics)|relation]]. * [[Relation (mathematics)|Relation]]
  5 KB (541 words) - 16:12, 11 November 2015
• Relation construction
  ...lational constructibility''' have to do with the ways that one [[relation (mathematics)|relation]] is determined by an indexed family or a sequence of other relat * [[Relation (mathematics)|Relation]]
  5 KB (621 words) - 19:18, 14 November 2015
• Boolean function
  A '''finitary boolean function''' is a [[function (mathematics)|function]] of the form <math>f : \mathbb{B}^k \to \mathbb{B},</math> where * [[Relation (mathematics)|Relation]]
  5 KB (589 words) - 20:24, 5 November 2015
• Differential logic
  * [[Relation (mathematics)|Relation]] [[Category:Inquiry]]
  6 KB (662 words) - 22:28, 5 November 2015
• Boolean domain
  * [[Relation (mathematics)|Relation]] [[Category:Inquiry]]
  5 KB (561 words) - 19:54, 5 November 2015
• Parametric operator
  * [[Relation (mathematics)|Relation]] [[Category:Inquiry]]
  5 KB (572 words) - 04:16, 7 November 2015

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