Hostname: page-component-cb9f654ff-w5vf4 Total loading time: 0 Render date: 2025-08-24T00:57:22.995Z Has data issue: false hasContentIssue false
  • English
  • Français

Eulerian syllogistic

Published online by Cambridge University Press:  12 March 2014

Ivo Thomas
Ivo Thomas*
Affiliation:
Blackfriars, Oxford
Get access Rights & Permissions [Opens in a new window]

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

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 22 , Issue 1 , March 1957 , pp. 15 - 16
Copyright
Copyright © Association for Symbolic Logic 1957

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

BIBLIOGRAPHY

[1]Faris, J. A., The Gergonne relations, this Journal, vol. 20 (1955), pp. 207–231.Google Scholar
[2]Łukasiewicz, Jan, Aristotle's syllogistic, Oxford (Clarendon Press), 1952, xi + 141 pp.Google Scholar
[3]Thomas, Ivo, A new decision procedure for Aristotle's syllogistic, Mind, vol. 41 (1952), pp. 564–566.Google Scholar