Induction and inductive definitions in fragments of second order arithmetic
From MaRDI portal
Recommendations
- Another reduction of classical ID_ to constructive ID^i_
- An intuitionistic fixed point theory
- Provably recursive functions of constructive and relatively constructive theories
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Proof-theoretical analysis: Weak systems of functions and classes
Cites work
- A slow growing analogue to Buchholz' proof
- An elementary fragment of second-order lambda calculus
- Consistency proofs of subsystems of classical analysis
- Finitely stratified polymorphism
- scientific article; zbMATH DE number 193575 (Why is no real title available?)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
Cited in
(14)- Induktive Definitionen und Dilatoren. (Inductive definitions and dilators)
- Fragments of HA based on \(\Sigma_ 1\)-induction
- A Buchholz rule for modal fixed point logics
- Enhancing induction in a contraction free logic with unrestricted abstraction: from \(\mathbf{Z}\) to \(\mathbf{Z}_2\)
- Inductive definitions over a predicative arithmetic
- Forcing for hat inductive definitions in arithmetic
- scientific article; zbMATH DE number 2186968 (Why is no real title available?)
- The proof theory of classical and constructive inductive definitions. A forty year saga, 1968--2008
- Another reduction of classical ID_ to constructive ID^i_
- A note on multiple inductive definitions
- Proof-theoretic strengths of weak theories for positive inductive definitions
- MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
- Elementary inductive definitions in HA: From strictly positive towards monotone
- Parameter-free polymorphic types
This page was built for publication: Induction and inductive definitions in fragments of second order arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486242)
