Search results

• Logic Syllabus
  * [[Relation theory]] * [[Truth theory]]
  3 KB (346 words) - 18:30, 27 May 2020
• Universe of discourse
  * [[Relation theory]] * [[Truth theory]]
  6 KB (702 words) - 19:14, 7 November 2015
• Peirce's law
  Here is Peirce's own statement and proof of the law: ==Graphical proof==
  11 KB (1,526 words) - 04:14, 18 November 2015
• Directory:Logic Museum/Peter King (medievalist)
  * Consequence as Inference: Mediaeval Proof Theory 1300-1350, in Medieval Formal Logic: Obligations, Insolubles, and Consequen * Aquinas on the Passions, in Aquinas's Moral Theory, edited by Scott MacDonald and Eleonore Stump, Cornell University Press 199
  6 KB (803 words) - 16:10, 21 February 2009
• Turing Award
  ...is fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the ...ng to found the following important subfields of [[computer science]]: the theory of [[parsing]], the [[semantics]] of programming languages, automatic [[pro
  11 KB (1,508 words) - 10:52, 2 November 2006
• Directory:Logic Museum/Gyula Klima
  *Klima, G. (2003) “Conceptual Closure in Anselm’s Proof: Reply to Tony Roark”, History and Philosophy of Logic, 24 (2003), pp. 13 *Klima, G. (2002) “Aquinas’ Theory of the Copula and the Analogy of Being”, Logical Analysis and History of
  17 KB (2,338 words) - 16:22, 21 February 2009
• Relation reduction
  ...y determined by its 2-adic projections. This can be seen by following the proof that is given below. Before tackling the proof, however, it will speed things along to recall a few ideas and notations fr
  29 KB (4,035 words) - 03:32, 15 November 2015
• Directory:Jon Awbrey/Papers/Propositions As Types
  ...with a typed parse tree for <math>\operatorname{I},</math> tantamount to a proof tree for <math>A \Rightarrow A.</math> ...ightarrow B) \Rightarrow (A \Rightarrow C))</math> serves as a clue to the proof of <math>\operatorname{P}'\text{s}</math> type proposition as a theorem of
  150 KB (9,422 words) - 23:54, 6 July 2013
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems
  =====Objective 1b : The Styles of Proof Development===== ===Basic Notions of Group Theory===
  15 KB (1,597 words) - 12:00, 15 April 2017
• Directory:Laurance W. Marvin
  ...played very important role in creating proprietary combination with Gann's theory for new technical forecasting models.
  5 KB (772 words) - 16:48, 26 December 2009
• Edward O Thorp
  ...blackjack]] player. He pioneered the modern applications of [[probability theory]], including the harnessing of very small [[correlation]]s for reliable fin ...ld be overcome by [[card counting]].<ref>[[Peter A. Griffin]] (1979) ''The Theory of Blackjack'', Huntington Press, {{ISBN|978-0929712130}}</ref> He also dev
  14 KB (2,003 words) - 12:17, 27 December 2017
• Directory:Jon Awbrey/MATH
  | The proof of their identity is, ...larly in new fields where the process of [[peer review]] of [[mathematical proof]]s is not firmly established, raising the probability of an undetected erro
  105 KB (15,875 words) - 22:02, 25 January 2008
• User:Jon Awbrey/MATH
  | The proof of their identity is, ...larly in new fields where the process of [[peer review]] of [[mathematical proof]]s is not firmly established, raising the probability of an undetected erro
  105 KB (15,873 words) - 11:53, 20 August 2007
• Propositional calculus
  * Chang, C.C., and Keisler, H.J. (1973), ''Model Theory'', North-Holland, Amsterdam, Netherlands. * Kohavi, Zvi (1978), ''Switching and Finite Automata Theory'', 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978.
  17 KB (2,301 words) - 15:56, 7 November 2015
• Prior Analytics
  Aristotle's theory of argumentation was fundamental to so-called ''traditional'' logic, which ...conclusion, in order to determine in what mode and figure of syllogism the proof is to proceed. Then find a middle term which has that relation to the subje
  9 KB (1,457 words) - 19:14, 16 January 2013
• User:Roygbiv/Graph
  A '''logical graph''' is a [[graph theory|graph-theoretic]] structure in one of the systems of graphical [[syntax]] t Simple intuition, or a simple inductive proof, assures us that any rooted tree can be reduced by way of the arithmetic in
  42 KB (5,905 words) - 21:49, 22 May 2010
• Logical graph
  Simple intuition, or a simple inductive proof, assures us that any rooted tree can be reduced by way of the arithmetic in ...on of the annotation scheme from LOF will be used to mark each step of the proof according to which axiom, or ''initial'', is being invoked to justify the c
  41 KB (5,845 words) - 14:26, 6 November 2015
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  ...use a variation of the annotation scheme from LOF to mark each step of the proof according to which axiom, or ''initial'', is being invoked to justify the c ...This means that all of the inference licensed by them are reversible. The proof annotation scheme employed below makes use of a double bar &#9552;&#9552;&#
  157 KB (17,761 words) - 03:44, 10 November 2016
• Directory:IBM
  ...=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 # verifiable documentation and proof of at least one area of specialty
  27 KB (3,847 words) - 01:40, 31 December 2008
• Philosophy of mathematics
  ...larly in new fields where the process of [[peer review]] of [[mathematical proof]]s is not firmly established, raising the probability of an undetected erro ...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
  73 KB (10,917 words) - 19:48, 6 September 2017

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