The following pages link to (Q3866106):
Displayed 11 items.
- The paradox of the knower revisited (Q392283) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- On bimodal logics of provability (Q1332858) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Provability algebras and proof-theoretic ordinals. I (Q1877092) (← links)
- Iterated local reflection versus iterated consistency (Q1899141) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule (Q5937826) (← links)