Pages that link to "Item:Q3661556"
From MaRDI portal
The following pages link to The optimality of induction as an axiomatization of arithmetic (Q3661556):
Displaying 15 items.
- Fragments of arithmetic (Q762484) (← links)
- Unprovability of theorems of complexity theory in weak number theories (Q1162506) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Reflection algebras and conservation results for theories of iterated truth (Q2120976) (← links)
- Hyperarithmetical worm battles (Q2151396) (← links)
- Local reflection, definable elements and 1-provability (Q2204378) (← links)
- Uniform density in Lindenbaum algebras (Q2258545) (← links)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986) (← links)
- Proof Theoretic Analysis by Iterated Reflection (Q4637223) (← links)
- Fragments of Arithmetic and true sentences (Q4680381) (← links)
- A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC (Q5044314) (← links)
- Set-theoretic reflection is equivalent to induction over well-founded classes (Q5117344) (← links)
- AXIOMATIZATION OF PROVABLE n-PROVABILITY (Q5222538) (← links)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION (Q5359565) (← links)
