On minimal models for pure calculi of names | Zendy

Piotr Kulicki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On minimal models for pure calculi of names

Author(s) -

Piotr Kulicki

Publication year - 2013

Publication title -

logic and logical philosophy

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.416

H-Index - 10

eISSN - 2300-9802

pISSN - 1425-3305

DOI - 10.12775/llp.2013.023

Subject(s) - syllogism , functor , simple (philosophy) , quantifier (linguistics) , propositional calculus , construct (python library) , propositional variable , mathematics , term (time) , calculus (dental) , fragment (logic) , propositional formula , computer science , algebra over a field , pure mathematics , discrete mathematics , algorithm , linguistics , philosophy , artificial intelligence , programming language , epistemology , intermediate logic , description logic , medicine , physics , dentistry , quantum mechanics

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 `e’ 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research