The Operational Penumbra: Some Ontological Aspects
From MaRDI portal
Publication:5214788
DOI10.1007/978-3-319-63334-3_10zbMath1429.03063OpenAlexW2795334294MaRDI QIDQ5214788
Publication date: 5 February 2020
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-63334-3_10
Foundations of classical theories (including reverse mathematics) (03B30) Proof theory in general (including proof-theoretic semantics) (03F03) Other classical set theory (including functions, relations, and set algebra) (03E20) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Operational closure and stability
- Relativized ordinal analysis: the case of power Kripke-Platek set theory
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- Operational set theory and small large cardinals
- Full operational set theory with unbounded existential quantification and power set
- Monotone inductive definitions in a constructive theory of functions and classes
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Constructivism in mathematics. An introduction. Volume I
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- On the proof-theoretic strength of monotone induction in explicit mathematics
- A set of postulates for the foundation of logic
- A set of postulates for the foundation of logic. II
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- On Feferman's operational set theory \textsf{OST}
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
- Reflections on reflections in explicit mathematics
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- Kripke-Platek Set Theory and the Anti-Foundation Axiom
- EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS
- Extending constructive operational set theory by impredicative principles
- The Operational Perspective: Three Routes
- Explicit mathematics with the monotone fixed point principle
- Explicit mathematics with the monotone fixed point principle. II: Models
- Power types in explicit mathematics?
- A well-ordering proof for Feferman's theoryT 0
- Monotone inductive definitions in explicit mathematics
- RELATIVIZING OPERATIONAL SET THEORY
- Universes in explicit mathematics
This page was built for publication: The Operational Penumbra: Some Ontological Aspects