Inductive definitions over a predicative arithmetic
From MaRDI portal
Recommendations
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
- The proof theory of classical and constructive inductive definitions. A forty year saga, 1968--2008
- New Computational Paradigms
- Induction and inductive definitions in fragments of second order arithmetic
- Proof-theoretic strengths of weak theories for positive inductive definitions
Cites work
- scientific article; zbMATH DE number 3781167 (Why is no real title available?)
- scientific article; zbMATH DE number 1215495 (Why is no real title available?)
- scientific article; zbMATH DE number 3999883 (Why is no real title available?)
- scientific article; zbMATH DE number 2110622 (Why is no real title available?)
- A new recursion-theoretic characterization of the polytime functions
- A slow growing analogue to Buchholz' proof
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
- Consistency proof via pointwise induction
- Elementary arithmetic
- Π12-logic, Part 1: Dilators
Cited in
(5)- New Computational Paradigms
- ABSTRACT INDUCTIVE AND CO-INDUCTIVE DEFINITIONS
- A theory of formal truth arithmetically equivalent to ID1
- The proof theory of classical and constructive inductive definitions. A forty year saga, 1968--2008
- scientific article; zbMATH DE number 1342277 (Why is no real title available?)
This page was built for publication: Inductive definitions over a predicative arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566072)