On Minimal Models for Pure Calculi of Names

Logic and Logical Philosophy 22 (4):429–443 (2013)
Download Edit this record How to cite View on PhilPapers
By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need an empty name in the model, so we are able to construct a 3-valued matrix, while for the latter, for which an empty name is necessary, the respective matrices are 4-valued
PhilPapers/Archive ID
Upload history
Archival date: 2013-10-22
View other versions
Added to PP index

Total views
753 ( #7,452 of 64,256 )

Recent downloads (6 months)
44 ( #17,691 of 64,256 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.