Pages that link to "Item:Q3808091"
From MaRDI portal
The following pages link to A combinatorial analysis of functions provably recursive in $ΙΣ_n$ (Q3808091):
Displaying 10 items.
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Inductive full satisfaction classes (Q920081) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- The contribution of Zygmunt Ratajczyk to the foundations of arithmetic (Q1913625) (← links)
- More on lower bounds for partitioning \(\alpha\)-large sets (Q2373693) (← links)
- Partitioning 𝛼–large sets: Some lower bounds (Q3420352) (← links)
- A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$ (Q3807195) (← links)
- Functions provably total in $I^{-}Σ_{n}$ (Q5899843) (← links)
- Functions provably total in $I^{-}Σ_{n}$ (Q5904006) (← links)
- Recursively defined combinatorial functions: Extending Galton's board (Q5946746) (← links)
