Article contents
Eulerian syllogistic
Published online by Cambridge University Press: 12 March 2014
Extract
Faris [1] presents a system for non-void classes employing four primitive functors with another defined, and based on ten asserted and eleven rejected axioms, with a special rule of rejection analogous to Słupecki's for the syllogistic. Primitive functors are here reduced to three, axioms are simplified, and it is shown that the system is decidable by the easier syllogistic means, e.g. the tabular method of Thomas [3].
From the theses (original numbering to the right with axioms starred)
we can deduce
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1957
References
BIBLIOGRAPHY
- 1
- Cited by