The unfolding of non-finitist arithmetic

DOI10.1016/S0168-0072(00)00008-7zbMath0959.03048MaRDI QIDQ1577479

Solomon Feferman, Thomas Strahm

Publication date: 2 May 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

generalized recursion theorypredicative analysisproof-theoretic analysisnon-finitist arithmeticunfolding of schematic formal systems

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Proof theory in general (including proof-theoretic semantics) (03F03) Higher-type and set recursion theory (03D65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

Reflection algebras and conservation results for theories of iterated truth, A feasible theory of truth over combinatory algebra, Error and Predicativity, NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE, POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND, 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000, The Operational Perspective: Three Routes, AXIOMS FOR DETERMINATENESS AND TRUTH, UNFOLDING FINITIST ARITHMETIC, Predicativity and Regions-Based Continua, Unfolding Schematic Systems, Feferman and the Truth, Predicativity and Feferman, Feferman on Set Theory: Infinity up on Trial, The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule, Reflecting and unfolding, Universes over Frege structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed points in Peano arithmetic with ordinals
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
• The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
• Computation on abstract data types. The extensional approach, with an application to streams
• Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
• The formal language of recursion
• Reflecting on incompleteness
• The role of parameters in bar rule and bar induction