- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Recursive models for constructive set theories
Annals of Mathematical Logic 23 (2-3):127-178 (1982)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Recursive models for constructive set theories.N. Beeson - 1982 - Annals of Mathematical Logic 23 (2/3):127.
Constructive Models.I͡Uriĭ Leonidovich Ershov - 2000 - Consultants Bureau. Edited by S. S. Goncharov.
Constructive toposes with countable sums as models of constructive set theory.Alex Simpson & Thomas Streicher - 2012 - Annals of Pure and Applied Logic 163 (10):1419-1436.
A Note on Recursive Models of Set Theories.Domenico Zambella & Antonella Mancini - 2001 - Notre Dame Journal of Formal Logic 42 (2):109-115.
Sufficiency conditions for theories with recursive models.Kelleen R. Hurlburt - 1992 - Annals of Pure and Applied Logic 55 (3):305-320.
Generalizing realizability and Heyting models for constructive set theory.Albert Ziegler - 2012 - Annals of Pure and Applied Logic 163 (2):175-184.
The natural numbers in constructive set theory.Michael Rathjen - 2008 - Mathematical Logic Quarterly 54 (1):83-97.
How complicated is the set of stable models of a recursive logic program?W. Marek, A. Nerode & J. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):119-135.
The number of uncountable models of omega-stable theories.Jürgen Saffe - 1983 - Annals of Mathematical Logic 24 (3):231.
Models of set theory containing many perfect sets.John Truss - 1974 - Annals of Mathematical Logic 7 (2):197.
Analytics
Added to PP
2014-01-17
Downloads
37 (#713,146)
6 months
9 (#543,394)
2014-01-17
Downloads
37 (#713,146)
6 months
9 (#543,394)
Historical graph of downloads
Citations of this work
Realizability and intuitionistic logic.J. Diller & A. S. Troelstra - 1984 - Synthese 60 (2):253 - 282.
Functional interpretation of Aczel's constructive set theory.Wolfgang Burr - 2000 - Annals of Pure and Applied Logic 104 (1-3):31-73.
Domain interpretations of martin-löf’s partial type theory.Erik Palmgren & Viggo Stoltenberg-Hansen - 1990 - Annals of Pure and Applied Logic 48 (2):135-196.
Inductive types and exact completion.Benno van den Berg - 2005 - Annals of Pure and Applied Logic 134 (2-3):95-121.
References found in this work
Metamathematical investigation of intuitionistic arithmetic and analysis.Anne S. Troelstra - 1973 - New York,: Springer.
The Type Theoretic Interpretation of Constructive Set Theory.Peter Aczel, Angus Macintyre, Leszek Pacholski & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):313-314.
A Language and Axioms for Explicit Mathematics.Solomon Feferman, J. N. Crossley, Maurice Boffa, Dirk van Dalen & Kenneth Mcaloon - 1984 - Journal of Symbolic Logic 49 (1):308-311.
The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations.Michael J. Beeson - 1975 - Journal of Symbolic Logic 40 (3):321-346.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6dc498764b-4pdvg uwo