Skip to main content
Branden Fitelson's user avatar
Branden Fitelson's user avatar
Branden Fitelson's user avatar
Branden Fitelson
  • Member for 4 years, 9 months
  • Last seen more than 4 years ago
comment
Representing modus ponens in a Polish propositional logic with NAND as the only connective
or, in TPTP format: (1) fof(scharle1,axiom,![X]: t(s(X,s(X,X)))). (2) fof(scharle2,axiom,![X,Y,U,R]: t(s(s(X,s(Y,R)),s(s(s(U,Y),s(s(X,U),s(X,U))),s(s(U,Y),s(s(X,‌​U),s(X,U))))))).
comment
Representing modus ponens in a Polish propositional logic with NAND as the only connective
Note: Scharle's two-basis contains a typo. Here is a sound and complete 2-axiom system, when combined with your weaker detachment rule (which Scharle calls D3): (1) DpDpp, (2) DDpDqrDDDsqDDpsDpsDDsqDDpsDps
comment
Representing modus ponens in a Polish propositional logic with NAND as the only connective
yes, i suspect there is a single axiom for the weaker rule. i'll be working on this now.
revised
Loading…
revised
Loading…
comment
Representing modus ponens in a Polish propositional logic with NAND as the only connective
note, also that Nicod's stronger rule also works with many other known axioms, including Lukaiewicz's. so, even if somehow this rule had worked with his axiom (in syntactically idiosyncratic way) it would still in this sense have been less generally useful than his stronger rule.
comment
Representing modus ponens in a Polish propositional logic with NAND as the only connective
Right, sorry, thanks Andreas. I have fixed this above. Now a 4-element model is required. Note that t(•) is the theorem-hood predicate, and c1 = 0 is the instance of s(s(X,X)X) that fails to be a theorem. i.e., t(s(s(0,0),0)) = 0.
awarded
revised
Loading…
awarded
Loading…