Search results

MyWikiBiz, Author Your Legacy — Monday April 29, 2024
Jump to navigationJump to search
Results 1 – 21 of 50
Advanced search

Search in namespaces:

  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  • ===Generation Theorem=== | [[Image:Generation Theorem 2.0 Animation.gif]]
    4 KB (416 words) - 04:20, 2 April 2010
  • ...19</ref><ref>Ethier, S.N. and D. A. Levin, D.A. [2005] On the fundamental theorem of card counting, with application to the game of trente et quarante, Adv. ...n Monte Carlo calculations and the application of a modified central limit theorem, Les Golden quantified these effects and indicated how players can regain s
    6 KB (838 words) - 17:02, 20 June 2017
  • ...rname{I} : A \Rightarrow A,</math> whose type, read as a proposition, is a theorem of intuitionistic propositional calculus. Check that <math>A \Rightarrow A</math> is a theorem of classical propositional calculus.
    150 KB (9,422 words) - 23:54, 6 July 2013
  • ...t was to make a construction that could be used in proving the Pythagorean theorem"
    14 KB (2,167 words) - 17:59, 20 February 2013
  • * The [[four-color theorem]] * The [[perfect graph|strong perfect graph theorem]]
    17 KB (2,473 words) - 11:44, 6 September 2007
  • ...texttt{( )},~\!</math> as simple as it appears, proves to be provable as a theorem on the grounds of the foregoing axioms. ...ames of ''Consequence&nbsp;1'' <math>(C_1)\!</math>, the ''double negation theorem'' (DNT), or ''Reflection''.
    41 KB (5,845 words) - 14:26, 6 November 2015
  • ...probably the first theoretically based yet practical tool for [[automated theorem proving|machine assisted proof construction]]; 2) [[ML programming language
    11 KB (1,508 words) - 10:52, 2 November 2006
  • ...ath>a(~) = (~),</math> as simple as it appears, proves to be provable as a theorem on the grounds of the foregoing axioms. ...the names of ''Consequence 1'' <math>(C_1)\!</math>, the ''double negation theorem'' (DNT), or ''Reflection''.
    42 KB (5,905 words) - 21:49, 22 May 2010
  • ...set contained an operation lacking that property. (The converse of Post's theorem, extending "if" to "if and only if", is the easy observation that a propert ...,8,&hellip;,2<sup>''n''</sup>,&hellip; This is called a '''representation theorem''' as it gives insight into the nature of finite Boolean algebras by giving
    46 KB (7,114 words) - 18:24, 2 October 2007
  • ...ames of ''Consequence&nbsp;1'' <math>(C_1),\!</math> the ''double negation theorem'' (DNT), or ''Reflection''. ====C<sub>2</sub>. Generation theorem====
    157 KB (17,761 words) - 03:44, 10 November 2016
  • ...lculus determines whether Peirce's law is taken as an axiom or proven as a theorem.
    11 KB (1,526 words) - 04:14, 18 November 2015
  • ...to put pragmatism as I understand it into the same form of a philosophical theorem. I have not succeeded any better than this:</p>
    12 KB (1,764 words) - 04:32, 17 November 2015
  • ...or all that we need to model is a formal fact that depends on a particular theorem in the logic of relatives. If it weren't for that, there would hardly be a ...that we noticed first, as simple as it appears, proves to be provable as a theorem on the grounds of the foregoing axioms.
    168 KB (21,027 words) - 12:41, 6 August 2017
  • ...lds (that is, you can generate the string corresponding to the Pythagorean theorem). Mathematical truths are not about numbers and sets and triangles and the ...rules of inference are truth-preserving), ''then'' you have to accept the theorem, or, rather, the interpretation you have given it must be a true statement.
    73 KB (10,917 words) - 19:48, 6 September 2017
  • ...which means that its interpretation for logical applications derives its [[theorem]]s from an empty axiom set.
    17 KB (2,301 words) - 15:56, 7 November 2015
  • ...lds (that is, you can generate the string corresponding to the Pythagorean theorem). ...rules of inference are truth preserving), ''then'' you have to accept the theorem, or, rather, the interpretation you have given it must be a true statement.
    177 KB (26,694 words) - 02:20, 15 December 2010
  • | align="right" | 5 || [[Fundamental theorem of arithmetic]]
    39 KB (4,682 words) - 14:55, 21 May 2007
  • | function theorem gives conditions under which the vanishing of the | and the space is a manifold with dimension n - k if the theorem
    567 KB (86,909 words) - 21:00, 6 December 2016
  • ...the regular representations of a group is universally known as ''Cayley's Theorem'', usually in the form: "Every group is isomorphic to a subgroup of ''Aut'
    112 KB (11,050 words) - 14:19, 22 May 2007
  • By way of providing a simple illustration of Cook's Theorem, namely, that &ldquo;Propositional Satisfiability is NP-Complete&rdquo;, I
    134 KB (16,535 words) - 15:30, 11 October 2013

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