Systems of explicit mathematics with non-constructive \(\mu\)-operator. I

DOI10.1016/0168-0072(93)90013-4zbMath0794.03074MaRDI QIDQ1314542

Solomon Feferman, Gerhard Jäger

Publication date: 28 August 1994

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(93)90013-4

zbMATH Keywords

induction; Peano arithmetic; basic theory of operators and numbers; ordinal stages; proof-theoretic analysis of systems of explicit mathematics

Mathematics Subject Classification ID

03F03: Proof theory in general (including proof-theoretic semantics)

Related Items

Polynomial time operations in explicit mathematics, Some theories with positive induction of ordinal strength φω0, Explicit mathematics: power types and overloading, Full operational set theory with unbounded existential quantification and power set, Formalizing non-termination of recursive programs, Theories with self-application and computational complexity., The unfolding of non-finitist arithmetic, The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule, Universes over Frege structures, Totality in applicative theories, Systems of explicit mathematics with non-constructive \(\mu\)-operator. II, On Feferman's operational set theory \textsf{OST}, Systems of explicit mathematics with non-constructive \(\mu\)-operator and join

Cites Work

• Proof theory. 2nd ed
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Constructivism in mathematics. An introduction. Volume I
• Fixed points in Peano arithmetic with ordinals
• Hilbert's program relativized; Proof-theoretical and foundational reductions
• A well-ordering proof for Feferman's theoryT 0
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item