The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
From MaRDI portal
Publication:639666
DOI10.1016/J.APAL.2011.01.009zbMath1253.03088OpenAlexW1963625635MaRDI QIDQ639666
Publication date: 22 September 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.01.009
Functionals in proof theory (03F10) Proof theory in general (including proof-theoretic semantics) (03F03) Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (3)
The Operational Perspective: Three Routes ⋮ The Operational Penumbra: Some Ontological Aspects ⋮ A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
Cites Work
- Generalized recursion theory II. Proceedings of the 1977 Oslo Symposium
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Fixed points in Peano arithmetic with ordinals
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories