Syntactical Proof of Translation and Separation Theorems on Subsystems of Elementary Ontology

Mathematical Logic Quarterly 37 (9‐12):129-138 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19910370902

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

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

Syntactical results on the arithmetical completeness of modal logic.Paolo Gentilini - 1993 - Studia Logica 52 (4):549 - 564.
Second order theories with ordinals and elementary comprehension.Gerhard Jäger & Thomas Strahm - 1995 - Archive for Mathematical Logic 34 (6):345-375.
Algebraic proofs of cut elimination.Jeremy Avigad - manuscript
Epistemology of visual thinking in elementary real analysis.Marcus Giaquinto - 1994 - British Journal for the Philosophy of Science 45 (3):789-813.
Embeddings between the elementary ontology with an atom and the monadic second-order predicate logic.Mitio Takano - 1987 - Studia Logica 46 (3):247 - 253.
Syntactical investigations intoBI logic andBB′I logic.Yuichi Komori - 1994 - Studia Logica 53 (3):397 - 416.
On the concept of proof in elementary geometry Pirmin stekeler-weithofer.Proof In Elementary - 1992 - In Michael Detlefsen (ed.), Proof and Knowledge in Mathematics. Routledge.
Consistent fragments of grundgesetze and the existence of non-logical objects.Kai F. Wehmeier - 1999 - Synthese 121 (3):309-328.
Three theorems of Godel.Andrew Boucher - manuscript
Glivenko theorems and negative translations in substructural predicate logics.Hadi Farahani & Hiroakira Ono - 2012 - Archive for Mathematical Logic 51 (7-8):695-707.
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.
Consistency statements and iterations of computable functions in IΣ1 and PRA.Joost J. Joosten - 2010 - Archive for Mathematical Logic 49 (7-8):773-798.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Applications of elementary submodels in general topology.Stefan Geschke - 2002 - Synthese 133 (1-2):31 - 41.

Analytics

Added to PP
2013-12-01

Downloads
12 (#1,081,406)

6 months
2 (#1,188,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Proof theory.Gaisi Takeuti - 1975 - New York, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.

View all 8 references / Add more references