The following pages link to Alexander Leitsch (Q167060):
Displayed 50 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Methods of cut-elimination (Q609451) (← links)
- Extraction of expansion trees (Q670704) (← links)
- Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
- CERES in higher-order logic (Q716500) (← links)
- A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains (Q759491) (← links)
- Item:Q167060 (redirect page) (← links)
- A simplified NP-complete satisfiability problem (Q790612) (← links)
- CERES: An analysis of Fürstenberg's proof of the infinity of primes (Q944367) (← links)
- A new combination of input and unit deductions for Horn sentences (Q1057665) (← links)
- Invariant transformations of formulas (Q1065781) (← links)
- The intractability of resolution (Q1071750) (← links)
- Rewrite method for theorem proving in first order theory with equality (Q1098649) (← links)
- A method for the mechanical derivation of formulas in elementary geometry (Q1099656) (← links)
- A more expressive formulation of many sorted logic (Q1101261) (← links)
- Linear strategy for propositional modal resolution (Q1113888) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- Item:Q167060 (redirect page) (← links)
- Fiducial intervals for the waiting time in batch and time-sharing systems (Q1160996) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Extending Horn clause logic with implication goals (Q1186427) (← links)
- Einführung in die Informatik. Algorithmenentwicklung. (Introduction into computer science. Development of algorithms.) (Q1188922) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- Theories of computational complexity (Q1210716) (← links)
- Intractable unifiability problems and backtracking (Q1262770) (← links)
- Cut normal forms and proof complexity (Q1302302) (← links)
- Recognizing planar objects using invariant image features (Q1308630) (← links)
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang (Q1329538) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- A sequent-calculus based formulation of the extended first epsilon theorem (Q1709688) (← links)
- Cut-elimination: syntax and semantics (Q2259012) (← links)
- Ceres in intuitionistic logic (Q2363201) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- Towards a clausal analysis of cut-elimination (Q2457341) (← links)
- Automated model building (Q2487870) (← links)
- Schematic refutations of formula schemata (Q2666952) (← links)
- (Q2751356) (← links)
- (Q2751377) (← links)
- Schematic Cut Elimination and the Ordered Pigeonhole Principle (Q2817924) (← links)
- Towards Algorithmic Cut-Introduction (Q2891453) (← links)
- (Q3001091) (← links)
- (Q3142019) (← links)
- Introducing Quantified Cuts in Logic with Equality (Q3192194) (← links)
- (Q3330550) (← links)
- Cut-Elimination and Proof Schemata (Q3455184) (← links)
- (Q3505121) (← links)
- (Q3597128) (← links)
- A Clausal Approach to Proof Analysis in Second-Order Logic (Q3605531) (← links)
- (Q3693521) (← links)