Skip to main content
Log in

Embedding the elementary ontology of stanisław Leśniewski into the monadic second-order calculus of predicates

  • II. Modifications And Generalizations Of First-Order Logic
  • Published:
Studia Logica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. Iwanuś,On Leśniewski elementary ontology,Studia Logica 31 (1973), pp. 73–125.

    Google Scholar 

  2. J. Słupecki,St. Leśniewski's calculus of names,Studia Logica 3 (1955), pp. 7–71.

    Google Scholar 

  3. 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.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01063840

Keywords

Navigation