Search results

Page title matches

• Relation (mathematics)
  In mathematics, a '''finitary relation''' is defined by one of the formal definitions give ...gned to deal with empirical data, and experience is always finite, whereas mathematics is nothing if not concerned with infinity, at the very least, potential inf
  20 KB (2,925 words) - 17:08, 14 November 2015
• Graph (mathematics)
  ...For the more general concept of the graph of a relation, see ''[[relation (mathematics)|relation]]''. In [[mathematics]] and [[computer science]], a '''graph''' is the basic object of study in [
  13 KB (1,934 words) - 12:06, 6 September 2007
• Philosophy of mathematics
  ...branch of [[philosophy]], it addresses questions about the character of [[mathematics]], the conduct of mathematical inquiry, and the role of [[mathematical obje # What kinds of inquiry play a role in mathematics?
  73 KB (10,917 words) - 19:48, 6 September 2017
• 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

Page text matches

• Relation type
  In [[logic]] and [[mathematics]] generally, and in the [[theory of relations]] specifically, relations fal * [[Function (mathematics)|Function]]
  847 bytes (100 words) - 17:20, 19 May 2007
• 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
• 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
• Relation
  #REDIRECT [[Relation (mathematics)]]
  36 bytes (3 words) - 20:35, 12 May 2010
• Relations
  #REDIRECT [[Relation (mathematics)]]
  36 bytes (3 words) - 21:24, 12 May 2010
• Null graph
  The '''null graph''' or the '''empty graph''' is the [[graph (mathematics)|graph]] with no points and no lines. [[Category:Mathematics]]
  475 bytes (59 words) - 20:10, 31 August 2017
• Grounded relation
  * [[Relation (mathematics)|Relation]] [[Category:Mathematics]]
  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
• Integer sequence
  [[Category:Mathematics]]
  254 bytes (32 words) - 19:58, 25 May 2007
• 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
• User:Jon Awbrey/WORKSPACE
  * [[Relation (mathematics)|Relation]] * [[Relation (mathematics)|Relation]]
  2 KB (192 words) - 04:54, 7 March 2011
• Prescisive abstraction
  ...given by [[Charles Sanders Peirce]] (CP 4.235, “[[The Simplest Mathematics]]” (1902), in ''Collected Papers'', CP 4.227–393). [[Category:Mathematics]]
  1,006 bytes (118 words) - 19:10, 10 November 2015
• Logic
  [[Category:Mathematics]]
  353 bytes (41 words) - 13:30, 2 July 2009
• Pragmaticism
  * [[Philosophy of mathematics]] * [[The Simplest Mathematics]]
  2 KB (254 words) - 04:12, 24 January 2008
• 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
• Central moving average
  '''Central moving average''' is a term in mathematics. For a number of applications it is advantageous to avoid the shifting ind
  499 bytes (78 words) - 21:13, 22 January 2010
• 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
• Logic of Relatives (1883)
  [[Category:History of Mathematics]] [[Category:Mathematics]]
  2 KB (252 words) - 02:12, 7 July 2008
• Logic of Relatives (1870)
  [[Category:History of Mathematics]] [[Category:Mathematics]]
  2 KB (280 words) - 02:10, 7 July 2008
• 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

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