Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
From MaRDI portal
Publication:2563984
DOI10.1016/S0168-0072(96)00005-XzbMath0862.03028OpenAlexW2045113137MaRDI QIDQ2563984
Publication date: 6 January 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(96)00005-x
explicit mathematicsfixed point theories with ordinalsnonconstructive \(\mu\)-operatorproof-theoretic analysis of subsystems of Feferman's theory \(\text{T}_ 1\)
Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (8)
The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice ⋮ Theories with self-application and computational complexity. ⋮ The Operational Perspective: Three Routes ⋮ Explicit mathematics: power types and overloading ⋮ The Operational Penumbra: Some Ontological Aspects ⋮ The unfolding of non-finitist arithmetic ⋮ The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule ⋮ Universes over Frege structures
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
- Monotone inductive definitions in a constructive theory of functions and classes
- 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
- The \(\mu\) quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Totality in applicative theories
- Understanding uniformity in Feferman's explicit mathematics
- Second order theories with ordinals and elementary comprehension
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
- Logical frameworks for truth and abstraction. An axiomatic study
- On the relation between choice and comprehension principles in second order arithmetic
- Hilbert's program relativized; Proof-theoretical and foundational reductions
- Beweistheorie vonKPN
- A well-ordering proof for Feferman's theoryT 0
- On power set in explicit mathematics
- Some theories with positive induction of ordinal strength φω0
This page was built for publication: Systems of explicit mathematics with non-constructive \(\mu\)-operator and join