Abstract
LetEO be the elementary ontology of Leśniewski formalized as in Iwanuś [1], and letLS be the monadic second-order calculus of predicates. In this paper we give an example of a recursive function ϕ, defined on the formulas of the language ofEO with values in the set of formulas of the language of LS, such that ⊢ EO A iff ⊢ LS ϕ(A) for each formulaA.
Similar content being viewed by others
References
B. Iwanuś,On Leśniewski elementary ontology,Studia Logica 31 (1973), pp. 73–125.
J. Słupecki,St. Leśniewski's calculus of names,Studia Logica 3 (1955), pp. 7–71.
V. Smirnov,The definition of modal operators with the help of tense operators, in:I. Niiniluoto andE. Saarinen (eds.),Intensional Logic: theory and applications,Acta Philosophica Fennica 35, Helsinki 1982.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Smirnov, V.A. Embedding the elementary ontology of stanisław Leśniewski into the monadic second-order calculus of predicates. Stud Logica 42, 197–207 (1983). https://doi.org/10.1007/BF01063840
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01063840