6533b7d1fe1ef96bd125d6c6

RESEARCH PRODUCT

The Syllogistic with Unity

Ian Pratt-hartmann

subject

logic and natural languageFOS: Computer and information sciencesPure mathematicsComputer Science - Logic in Computer Sciencecomputational complexityComputational complexity theoryComputational logicSyllogismMathematics - Logicproof theorysyllogismsDerivation relationLogic in Computer Science (cs.LO)Reductio ad absurdumPhilosophyPhilosophy of logicProof theoryCalculusFOS: MathematicsF.4.0Logic (math.LO)Finite setMathematics03B65

description

We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.

yearjournalcountryeditionlanguage
2011-10-11
http://arxiv.org/abs/1110.2317