- 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
Bulletin of Symbolic Logic 20 (3):275-292 (2014)
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 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.
Wellordering proofs for metapredicative Mahlo.Thomas Strahm - 2002 - Journal of Symbolic Logic 67 (1):260-278.
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.
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.
Operational set theory and small large cardinals.Solomon Feferman with with R. L. Vaught - manuscript
Relativizing operational set theory.Gerhard Jäger - 2016 - Bulletin of Symbolic Logic 22 (3):332-352.
Full operational set theory with unbounded existential quantification and power set.Gerhard Jäger - 2009 - Annals of Pure and Applied Logic 160 (1):33-52.
Analytics
Added to PP
2016-06-30
Downloads
32 (#707,649)
6 months
14 (#231,507)
2016-06-30
Downloads
32 (#707,649)
6 months
14 (#231,507)
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.
From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2013 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 120 - 139.
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.
References found in this work
Systems of explicit mathematics with non-constructive μ-operator. Part II.Solomon Feferman & Gerhard Jäger - 1996 - Annals of Pure and Applied Logic 79 (1):37-52.
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.
On Feferman’s operational set theory OST.Gerhard Jäger - 2007 - Annals of Pure and Applied Logic 150 (1-3):19-39.
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms.Gerhard Jäger & Thomas Studer - 2002 - Annals of Pure and Applied Logic 114 (1-3):79-101.
Full operational set theory with unbounded existential quantification and power set.Gerhard Jäger - 2009 - Annals of Pure and Applied Logic 160 (1):33-52.
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-648784bb4d-xlp8h uwo