Understanding uniformity in Feferman's explicit mathematics
From MaRDI portal
Publication:1899146
DOI10.1016/0168-0072(94)00058-BzbMath0845.03026OpenAlexW2120929535MaRDI QIDQ1899146
Publication date: 4 October 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)00058-b
Related Items (4)
On the proof-theoretic strength of monotone induction in explicit mathematics ⋮ A theory of rules for enumerated classes of functions ⋮ Systems of explicit mathematics with non-constructive \(\mu\)-operator and join ⋮ Universes over Frege structures
Uses Software
Cites Work
- Proof theory. 2nd ed
- Ein Wohlordnungsbeweis für das Ordinalzahlensystem T(J). (A proof of the wellordering of the ordinal number system T(J))
- 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
- On the relation between choice and comprehension principles in second order arithmetic
- Partial realizations of Hilbert's program
- Hilbert's program relativized; Proof-theoretical and foundational reductions
- The Universe of Set Theory
- On the Interpretation of Non-Finitist Proofs--Part I
- 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: Understanding uniformity in Feferman's explicit mathematics