The syllogistic with unity
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- Carathéodory bounds for integer cones
- Completeness of an ancient logic
- scientific article; zbMATH DE number 1549896 (Why is no real title available?)
- scientific article; zbMATH DE number 3076638 (Why is no real title available?)
- LOGICS FOR THE RELATIONAL SYLLOGISTIC
- No Syllogisms for the Numerical Syllogistic
- Numerical term logic
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- Pure numerical Boolean syllogisms
- The Hamiltonian syllogistic
- What is a syllogism?
Cited in
(18)- Non-classical syllogistic inference and the method of resolution
- A matricial vue of classical syllogistic and an extension of the rules of valid syllogism to rules of conclusive syllogisms with indefinite terms
- Relational syllogisms with numerical quantifiers and beyond
- The Hamiltonian syllogistic
- Higher-order syllogistics
- Syllogistic logic with ``most
- Singular extensions of Łukasiewicz syllogistic
- Syllogistic logic with cardinality comparisons
- No Syllogisms for the Numerical Syllogistic
- Head or tail? de morgan on the bounds of traditional logic
- Adding Guarded Constructions to the Syllogistic
- Variation and pattern in the 3-term syllogisms and the biliteral sorites of types Barbara, Darapti and Darii
- Syllogistic logic with cardinality comparisons, on infinite sets
- Syllogistic logic with complements
- Syllogistic logic with ``most
- On the logic of UNITY
- Parry syllogisms
- The unity of a Tractarian fact
This page was built for publication: The syllogistic with unity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377188)