Search results

• Talk:Peirce's law
  \textbf{Peirce's law} is a formula in propositional calculus that is commonly expressed in the following form: ...itional calculus. The precise axiom system that one chooses for classical propositional calculus determines whether Peirce's law is taken as an axiom or proven as
  5 KB (708 words) - 12:34, 27 July 2009
• User:Jon Awbrey/DIFF
  ===Table 1. Syntax & Semantics of a Calculus for Propositional Logic=== Table 1. Syntax & Semantics of a Calculus for Propositional Logic
  353 KB (17,505 words) - 16:10, 26 May 2007
• User:Jon Awbrey/ATLAS
  ===Table 1. Syntax & Semantics of a Calculus for Propositional Logic=== Table 1. Syntax & Semantics of a Calculus for Propositional Logic
  463 KB (31,052 words) - 15:00, 25 August 2007
• Propositional calculus
  ...and the principles of ''propositional logic'' (or ''sentential logic''). Propositional logic is a domain of formal subject matter that is, up to somorphism, const ...tives''. A ''well-formed formula'' (''wff'') is any atomic formula or any formula that can be built up from atomic formulas by means of operator symbols.
  17 KB (2,301 words) - 15:56, 7 November 2015
• Peirce's law
  '''Peirce's law''' is a formula in [[propositional calculus]] that is commonly expressed in the following form: ...itional calculus. The precise axiom system that one chooses for classical propositional calculus determines whether Peirce's law is taken as an axiom or proven as
  11 KB (1,526 words) - 04:14, 18 November 2015
• Directory:Jon Awbrey/Papers/Propositions As Types
  ...,</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
• User:Jon Awbrey/ARCHIVE
  * [[Propositional Equation Reasoning Systems]] * [http://forum.wolframscience.com/printthread.php?threadid=297&perpage=35 Propositional Equation Reasoning Systems].
  39 KB (4,682 words) - 14:55, 21 May 2007
• Directory:Jon Awbrey/Papers/Differential Propositional Calculus
  {{DISPLAYTITLE:Differential Propositional Calculus}} A '''differential propositional calculus''' is a [[propositional calculus]] extended by a set of terms for describing aspects of change and
  158 KB (22,468 words) - 03:24, 27 December 2016
• Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata
  :* [[Propositional Equation Reasoning Systems|Propositional Equation Reasoning Systems (PERS)]] ...anguage for the tasks that are usually associated with boolean algebra and propositional calculus makes it possible to entertain a further extension, to what we may
  134 KB (16,535 words) - 15:30, 11 October 2013
• Relation composition
  ...esentation of Tarski's trick, and the invocation of the following symbolic formula, claimed to be a definition of the relational composition <math>P \circ Q\! ...etation can now be given that fleshes out in graphic form the meaning of a formula like the following:
  65 KB (6,802 words) - 18:14, 14 November 2015
• Directory talk:Jon Awbrey/Papers/Inquiry Driven Systems
  a "description", an "expression", or a "formula", in other words, as Frequently this "formula" has a "variable" in it that "ranges over" the
  36 KB (5,725 words) - 18:46, 16 January 2009
• Pragmatic Semiotic Information
  ...cifically, as the ''average uncertainty reduction on receiving a sign'', a formula with the splendid mnemonic &ldquo;AURORAS&rdquo;. * [[Propositional calculus]]
  20 KB (2,552 words) - 15:16, 2 March 2024
• Semiotic Information
  ...cifically, as the ''average uncertainty reduction on receiving a sign'', a formula with the splendid mnemonic &ldquo;AURORAS&rdquo;. * [[Propositional calculus]]
  20 KB (2,557 words) - 15:36, 5 November 2020
• Directory:Jon Awbrey/Papers/Semiotic Information
  ...cifically, as the ''average uncertainty reduction on receiving a sign'', a formula with the splendid mnemonic &ldquo;AURORAS&rdquo;. * [[Propositional calculus]]
  20 KB (2,560 words) - 14:10, 29 October 2016
• User:Jon Awbrey/DIFF/A
  ...ou can do, once you have a really decent calculus for boolean functions or propositional logic, whatever you want to call it, is to compute the differentials of the ...he value of the proposition ''xy'' where you are, all expressed as general formula, of course? Here 'tis:
  112 KB (11,050 words) - 14:19, 22 May 2007
• Directory:Jon Awbrey/Papers/Differential Logic : Introduction
  ...that map a source universe into a target universe. This augments ordinary propositional calculus in the same way that the differential calculus of Leibniz and Newt ===Cactus Language for Propositional Logic===
  131 KB (20,198 words) - 15:38, 2 December 2015
• User:Jon Awbrey/DIFF/B
  favorite version of the syntax for propositional calculus all in a relatively in propositional calculus, this notion of model is almost too simple
  107 KB (9,168 words) - 14:23, 22 May 2007
• Directory:Jon Awbrey/Papers/Functional Logic : Inquiry and Analogy
  ...aph theorists. Hence the name ''[[cactus language]]'' for this dialect of propositional calculus. <p>The formula of analogy is as follows: &nbsp; <math>S^{\prime}, S^{\prime\prime}, ~\oper
  106 KB (13,991 words) - 18:45, 18 March 2020
• Directory:Jon Awbrey/Papers/Dynamics And Logic
  ...interest in the NKS Forum. This adaptation draws on the "Cactus Rules", "Propositional Equation Reasoning Systems", and "Reductions Among Relations" threads, and ...do, once you have a moderately efficient calculus for boolean functions or propositional logic, whatever you choose to call it, is to start thinking about, and even
  127 KB (18,875 words) - 13:28, 10 December 2014
• Directory talk:Jon Awbrey/Papers/Differential Logic
  or propositional logic, whatever you want to call it, expressed as general formula, of course? Here 'tis:
  135 KB (15,072 words) - 09:02, 4 June 2009

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