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

Studia Logica 42 (2-3):197 - 207 (1983)
  Copy   BIBTEX

Abstract

LetEO be the elementary ontology of Leniewski 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.

Categories

Keywords

Reprint years

DOI

10.1007/bf01063840

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A Correction to "Embedding the Elementary Ontology of Stanisław Leśniewski into the Monadic Second-Order Calculus of Predicates".V. A. Smirnov - 1986 - Studia Logica 45 (2):231 -.
Strict embedding of the elementary ontology into the monadic second-order calculus of predicates admitting the empty individual domain.Vladimir A. Smirnov - 1987 - Studia Logica 46 (1):1 - 15.
Embeddings between the elementary ontology with an atom and the monadic second-order predicate logic.Mitio Takano - 1987 - Studia Logica 46 (3):247 - 253.
Linguistic applications of first order intuitionistic linear logic.Richard Moot & Mario Piazza - 2001 - Journal of Logic, Language and Information 10 (2):211-232.
On countable chains having decidable monadic theory.Alexis Bés & Alexander Rabinovich - 2012 - Journal of Symbolic Logic 77 (2):593-608.
The complexity of first-order and monadic second-order logic revisited.Markus Frick & Martin Grohe - 2004 - Annals of Pure and Applied Logic 130 (1-3):3-31.
Definability in the monadic second-order theory of successor.J. Richard Buchi & Lawrence H. Landweber - 1969 - Journal of Symbolic Logic 34 (2):166 - 170.
Expressiveness of the modal mu-calculus on monotone neighborhood structures.Sebastian Enqvist, Fatemeh Seifan & Yde Venema - unknown
A didactical approach to the zero-one decision procedure of the expressions of the first order monadic predicate calculus.L. Borkowski - 1961 - Studia Logica 11 (1):76.
Elimination problems in logic: a brief history.William Craig - 2008 - Synthese 164 (3):321-332.

Analytics

Added to PP
2009-01-28

Downloads
42 (#111,429)

6 months
6 (#1,472,471)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Stanisław leśniewski.Peter Simons - 2008 - Stanford Encyclopedia of Philosophy.
Syntactical Proof of Translation and Separation Theorems on Subsystems of Elementary Ontology.Mitio Takano - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (9-12):129-138.

Add more citations

References found in this work

S. Leśniewski's Calculus of Names.Jerzy Słupecki - 1984 - In Jan T. J. Srzednicki, V. F. Rickey & J. Czelakowski (eds.), Leśniewski's systems. Hingham, MA, USA: Distributors for the United States and Canada, Kluwer Boston. pp. 59--122.
S. leśniewski's calculus of names.Jerzy Słupecki - 1955 - Studia Logica 3 (1):7-72.
On leśniewski's elementary ontology.Bogusław Iwanuś - 1973 - Studia Logica 31 (1):73 - 125.
On Le'sniewski's Elementary Ontology.Bogusław Iwanuś - 1973 - Studia Logica 31 (1):7-72.
On Leśniewski's Elementary Ontology.Boguslaw Iwanuś - 1984 - In Jan T. J. Srzednicki, V. F. Rickey & J. Czelakowski (eds.), Leśniewski's systems. Hingham, MA, USA: Distributors for the United States and Canada, Kluwer Boston. pp. 165--215.

Add more references