The following pages link to (Q3893931):
Displayed 15 items.
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- On Gödel incompleteness and finite combinatorics (Q581400) (← links)
- A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) (Q685068) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Inductive full satisfaction classes (Q920081) (← links)
- On the number of steps in proofs (Q1119576) (← links)
- On the finite containment problem for Petri nets (Q1819937) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Short proofs for slow consistency (Q2176406) (← links)
- Connected components of graphs and reverse mathematics (Q2277258) (← links)
- Slow reflection (Q2407272) (← links)
- Independence of Ramsey theorem variants using $\varepsilon _0$ (Q2789881) (← links)
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS (Q6131232) (← links)