An axiomatisation of a pure calculus of names

DOI10.1007/S11225-012-9441-8MaRDI QIDQ1928489zbMATH OpenOpenAlexFDO

Authors Piotr Kulicki

Publication date 3 January 2013

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11225-012-9441-8

zbMATH Keywords

axiomatic rejectioncalculus of namesHorn theoryLeśniewski Ontology

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other nonclassical logic (03B60)

Review text

In this paper, by a pure calculus of names (PCN) is meant a quantifier-free fragment of Leśniewski's Ontology based on the classical propositional calculus. In contrast to [\textit{A. Ishimoto}, Stud. Log. 36(1977), 285--299 (1978; Zbl 0391.03004); \textit{M. Kobayashi} and \textit{A. Ishimoto}, Stud. Log. 41, 181--195 (1982; Zbl 0597.03015)], the author has chosen three primitive \(nn/s\) type functors: Leśniewski's \(\varepsilon\) and functors \(a\) and \(i\) of Aristotle's syllogistic (\(a\) with the so-called strong interpretation; vacuous names are admitted). An axiomatisation of, and a decision procedure for, PCN are presented; the axioms are shown to be independent. The main discussion concerns adequacy of PCN (only weak completeness is dealt with). PCN is enriched to an axiomatic rejection system; it is then proved that every formula in the language of PCN is either a thesis or a rejected one, and no formula is both proved and rejected. This allows to conclude that any extension of PCN must contain undesirable theses, and to prove that PCN is (sound and) complete with respect to a certain natural class of set-theoretical models. The latter result leads to the following conservativeness theorem: Every thesis of the so-called basic Ontology formulated in the language of PCN is a thesis of PCN. Here, basic Ontology is a first-order theory whose language is that of PCN enriched by quantifiers; its axioms are Leśniewski's \(\varepsilon\)-axiom and definitions for \(a\) and \(i\).

Recommendations

• On minimal models for pure calculi of names
• Publication:4888338
• Leśniewski's ontology -- proof-theoretic characterization
• Pure modal logic of names and tableau systems
• Modal logic with names
• The functional completeness of Leśniewski's systems
• scientific article; zbMATH DE number 5015951
• Classical logic with non-referring names
• scientific article; zbMATH DE number 1722648
• scientific article; zbMATH DE number 7238893

Cites work

• A note on identity and higher order quantification
• A propositional fragment of Lesniewski's ontology
• A System of Ontology Based on Identity and Partial Ordering as an Adequate Logical Apparatus for Describing Taxonomical Structures of Concepts
• scientific article; zbMATH DE number 1867307 (Why is no real title available?)
• scientific article; zbMATH DE number 910447 (Why is no real title available?)
• scientific article; zbMATH DE number 3200651 (Why is no real title available?)
• scientific article; zbMATH DE number 3066797 (Why is no real title available?)
• LOGICS FOR THE RELATIONAL SYLLOGISTIC
• Some non-standard interpretations of the axiomatic basis of Leśniewski's Ontology
• The decision problem for some classes of sentences without quantifiers

Cited in

(8)

• Pure modal logic of names and tableau systems
• A congruence format for name-passing calculi
• Ontology as a Natural Extension of Predicate Calculus with Identity Equipped with Description
• scientific article; zbMATH DE number 6851953 (Why is no real title available?)
• The Misnamings of Playfair’s Axiom
• scientific article; zbMATH DE number 910447 (Why is no real title available?)
• scientific article; zbMATH DE number 6174927 (Why is no real title available?)
• On minimal models for pure calculi of names

This page was built for publication: An axiomatisation of a pure calculus of names

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928489)