The following pages link to (Q3786479):
Displaying 12 items.
- New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems (Q804570) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- The number of proof lines and the size of proofs in first order logic (Q1102280) (← links)
- On the number of steps in proofs (Q1119576) (← links)
- The undecidability of \(k\)-provability (Q1176199) (← links)
- Note on generalizing theorems in algebraically closed fields (Q1267838) (← links)
- The Kreisel length-of-proof problem (Q1353977) (← links)
- Reprint of: ``A more general general proof theory'' (Q1693594) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- A theorem on generalizations of proofs (Q2640597) (← links)
- (Q3467531) (← links)
- (Q4459910) (← links)