An Axiomatisation of a Pure Calculus of Names

  title={An Axiomatisation of a Pure Calculus of Names},
  author={Piotr Kulicki},
  journal={Studia Logica},
  • Piotr Kulicki
  • Published 2012
  • Mathematics, Computer Science
  • Studia Logica
A calculus of names is a logical theory describing relations between names. By a pure calculus of names we mean a quantifier-free formulation of such a theory, based on classical propositional calculus. An axiomatisation of a pure calculus of names is presented and its completeness is discussed. It is shown that the axiomatisation is complete in three different ways: with respect to a set theoretical model, with respect to Leśniewski’s Ontology and in a sense defined with the use of axiomatic… Expand
On Minimal Models for Pure Calculi of Names
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 aExpand
Pure Modal Logic of Names and Tableau Systems
By a pure modal logic of names (PMLN) we mean a quantifier-free formulation of such a logic which includes not only traditional categorical, but also modal categorical sentences with modalities de reExpand
Refutation Systems: An Overview and Some Applications to Philosophical Logics
An overview with comprehensive references on the historical development of the theory of refutation systems is provided and some of their applications to philosophical logics are discussed. Expand


Some non-standard interpretations of the axiomatic basis of Leśniewski’s Ontology
We propose an intuitive understanding of the statement: ‘an axiom (or: an axiomatic basis) determines the meaning of the only specific constant occurring in it.’ We introduce some basic semantics forExpand
Remarks on Axiomatic Rejection in Aristotle’s Syllogistic
In the paper we examine the method of axiomatic r ejection used to describe the set of nonvalid formulae of Aristotle’s syllogistic. First we show that the condition which the system of syllog isticExpand
A Note on Identity and Higher Order Quantification
It is a commonplace remark that the identity relation, even though not expressible in a first-order language without identity with classical set-theoretic semantics, can be defined in a languageExpand
S. Leśniewski’s Calculus of Names
The only primitive term in Leśniewski’s system of the Calculus of Names is the verb ‘is’ for which the participle ‘being’ corresponds to the Greek ‘oν’1 (gen. ‘oντoζ’). This was by no means the onlyExpand
Existence and Reference in Medieval Logic
“The expression ‘free logic’ is an abbreviation for the phrase ‘free of existence assumptions with respect to its terms, general and singular’.”1 Classical quantification theory is not a free logicExpand
  • C. Besson
  • Computer Science, Philosophy
  • The Review of Symbolic Logic
  • 2009
It is shown that adequate logics for internalism and externalism about natural kind nouns are second- order logics, and that an internalist second-order logic is a free logic—a second order logic free of existential commitments for natural kind adjectives. Expand
This paper identifies several fragments based on whether negation is permitted on all nouns, including those in the subject of a sentence; and whether the subject noun phrase may contain a relative clause. Expand
The Decision Problem for Some Classes of Sentences Without Quantifiers
  • J. McKinsey
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1943
A rather broad sufficient condition for the existence of a decision method for sentences without quantifiers is formulated, and it is shown that this condition holds of lattices. Expand
Formal Logic.
FRANK PLUMPTON RAMSEY, recognised as a leader of Cambridge thought at the age of sixteen, died at the age of twenty-six. This volume contains his chief writings on logic and philosophy, about half ofExpand
A propositional fragment of Leśniewski's ontology