Pages that link to "Item:Q1167721"
From MaRDI portal
The following pages link to Lower bounds for increasing complexity of derivations after cut elimination (Q1167721):
Displaying 17 items.
- The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics (Q383070) (← links)
- The epsilon calculus and Herbrand complexity (Q817706) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Cut normal forms and proof complexity (Q1302302) (← links)
- The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- The number of axioms (Q2120967) (← links)
- Andrews Skolemization may shorten resolution proofs non-elementarily (Q2151391) (← links)
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) (Q2400502) (← links)
- Translation of resolution proofs into short first-order proofs without choice axioms (Q2486578) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- UNSOUND INFERENCES MAKE PROOFS SHORTER (Q4628675) (← links)
- Cycling in proofs and feasibility (Q4942870) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- Asymptotic cyclic expansion and bridge groups of formal proofs (Q5945614) (← links)
- Herbrand complexity and the epsilon calculus with equality (Q6178471) (← links)
