The following pages link to (Q4304753):
Displaying 27 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- On the elimination of quantifier-free cuts (Q650922) (← links)
- Extraction of expansion trees (Q670704) (← links)
- CERES in higher-order logic (Q716500) (← links)
- The epsilon calculus and Herbrand complexity (Q817706) (← links)
- CERES: An analysis of Fürstenberg's proof of the infinity of primes (Q944367) (← links)
- On the form of witness terms (Q982183) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- Cut normal forms and proof complexity (Q1302302) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Generalizing theorems in real closed fields (Q1899140) (← links)
- Induction and Skolemization in saturation theorem proving (Q2084957) (← links)
- Andrews Skolemization may shorten resolution proofs non-elementarily (Q2151391) (← links)
- Ceres in intuitionistic logic (Q2363201) (← links)
- Automation for interactive proof: first prototype (Q2432769) (← links)
- Towards a clausal analysis of cut-elimination (Q2457341) (← links)
- Translation of resolution proofs into short first-order proofs without choice axioms (Q2486578) (← links)
- The Skolemization of existential quantifiers in intuitionistic logic (Q2503404) (← links)
- Controlling witnesses (Q2566063) (← links)
- Schematic Cut Elimination and the Ordered Pigeonhole Principle (Q2817924) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- Non-elementary speed-ups in proof length by different variants of classical analytic calculi (Q4610324) (← links)
- Projection: A unification procedure for tableaux in Conceptual Graphs (Q4610329) (← links)
- UNSOUND INFERENCES MAKE PROOFS SHORTER (Q4628675) (← links)
- Herbrand Sequent Extraction (Q5505525) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)
