- 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
Explicit mathematics and operational set theory: Some ontological comparisons
Abstract
We discuss several ontological properties of explicit mathematics and operational set theory: global choice, decidable classes, totality and extensionality of operations, function spaces, class and set formation via formulas that contain the definedness predicate and applications.Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Explicit mathematics and operational set theory: Some ontological comparisons.Gerhard Jäger & Rico Zumbrunnen - 2014 - Bulletin of Symbolic Logic 20 (3):275-292.
Explicit mathematics and operational set theory: Some ontological comparisons.Gerhard Jäger And Rico Zumbrunnen - 2014 - Bulletin of Symbolic Logic 20 (3):275-292,.
Elementary Constructive Operational Set Theory.Andrea Cantini & Laura Crosilla - 2010 - In Ralf Schindler (ed.), Ways of Proof Theory. De Gruyter. pp. 199-240.
Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory.Gerhard Jager & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.Gerhard Jager & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
Wellordering proofs for metapredicative Mahlo.Thomas Strahm - 2002 - Journal of Symbolic Logic 67 (1):260-278.
A first course in mathematical logic and set theory.Michael L. O'Leary - 2015 - Hoboken, New Jersey: Wiley.
Relativizing operational set theory.Gerhard Jäger - 2016 - Bulletin of Symbolic Logic 22 (3):332-352.
Constructive Set Theory with Operations.Andrea Cantini & Laura Crosilla - 2007 - In Alessandro Andretta, Keith Kearnes & Domenico Zambella (eds.), Logic Colloquium 2004: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Torino, Italy, July 25-31, 2004. Cambridge: Cambridge University Press.
On the proof-theoretic strength of monotone induction in explicit mathematics.Thomas Glaß, Michael Rathjen & Andreas Schlüter - 1997 - Annals of Pure and Applied Logic 85 (1):1-46.
Analytics
Added to PP
2014-12-05
Downloads
32 (#708,450)
6 months
5 (#1,047,105)
2014-12-05
Downloads
32 (#708,450)
6 months
5 (#1,047,105)
Historical graph of downloads
Citations of this work
A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π 1 -equivalent to KP.Kentaro Sato & Rico Zumbrunnen - 2015 - Annals of Pure and Applied Logic 166 (2):121-186.
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T 0.Kentaro Sato - 2015 - Annals of Pure and Applied Logic 166 (7-8):800-835.
Explicit mathematics and operational set theory: Some ontological comparisons.Gerhard Jäger & Rico Zumbrunnen - 2014 - Bulletin of Symbolic Logic 20 (3):275-292.
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-667477cd97-7qg25 dc2