Studia Logica 100 (5):921-946 (2012)

Piotr Kulicki
John Paul II Catholic University of Lublin
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 rejection. The independence of axioms is proved. A decision procedure based on syntactic transformations and models defined in the domain of only two members is defined
Keywords Calculus of names  Leśniewski’s Ontology  Horn theories  Axiomatic rejection
Categories (categorize this paper)
DOI 10.1007/s11225-012-9441-8
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,661
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Logics for the Relational Syllogistic.Ian Pratt-Hartmann & Lawrence S. Moss - 2009 - Review of Symbolic Logic 2 (4):647-683.
Formal Logic. Prior - 1955 - Oxford University Press.
Remarks on Axiomatic Rejection in Aristotle’s Syllogistic.Piotr Kulicki - 2002 - Studies in Logic and Theory of Knowledge 5:231-236.
S. Leśniewski's Calculus of Names.Jerzy Słupecki - 1984 - In Jan T. J. Srzednicki, V. F. Rickey & J. Czelakowski (eds.), Studia Logica. Distributors for the United States and Canada, Kluwer Boston. pp. 59--122.
Dual Counterparts of Consequence Operations.Ryszard Wójcicki - 1973 - Bulletin of the Section of Logic 2 (1):54-57.

View all 13 references / Add more references

Citations of this work BETA

On Minimal Models for Pure Calculi of Names.Piotr Kulicki - 2013 - Logic and Logical Philosophy 22 (4):429–443.

Add more citations

Similar books and articles

Reism and Le'sniewski's Ontology.Jan Wole'nski - 1986 - History and Philosophy of Logic 7 (2):167-176.
Axiomatisation and Decidability Off Andp in Cyclical Time.Mark Reynolds - 1994 - Journal of Philosophical Logic 23 (2):197 - 224.
S. Leśniewski's Calculus of Names.Jerzy Słupecki - 1955 - Studia Logica 3 (1):7-72.
Names as Tokens and Names as Tools.M. W. Pelczar - 2001 - Synthese 128 (1-2):133 - 155.
Modal Pure Type Systems.Tijn Borghuis - 1998 - Journal of Logic, Language and Information 7 (3):265-296.
An Interpolation Lemma for the Pure Implicational Calculus.Roy Edelstein - 1975 - Journal of Symbolic Logic 40 (3):443-444.
Λμ-Calculus and Böhm's Theorem.René David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
The Pure Calculus of Entailment.Alan Ross Anderson & Nuel D. Belnap - 1962 - Journal of Symbolic Logic 27 (1):19-52.


Added to PP index

Total views
32 ( #305,583 of 2,340,027 )

Recent downloads (6 months)
3 ( #241,877 of 2,340,027 )

How can I increase my downloads?


My notes