Pages that link to "Item:Q6488518"
From MaRDI portal
The following pages link to A theorem prover for a computational logic (Q6488518):
Displaying 16 items.
- An extension of the Boyer-Moore theorem prover to support first-order quantification (Q688572) (← links)
- The addition of bounded quantification and partial functions to a computational logic and its theorem prover (Q1107510) (← links)
- A circumscriptive theorem prover (Q1123640) (← links)
- A family of goal directed theorem provers based on conjunction and implication. I (Q1181711) (← links)
- Structured theory development for a mechanized logic (Q1595929) (← links)
- Fermat, Euler, Wilson -- three case studies in number theory (Q1707601) (← links)
- An interactive calculus theorem-prover for continuity properties (Q1823014) (← links)
- Induction using term orders (Q1915132) (← links)
- Combining induction and saturation-based theorem proving (Q2303240) (← links)
- Tactic-based inductive theorem prover for data types with partial operations (Diss., Univ. Kaiserslautern, 1999) (Q2726307) (← links)
- A theorem prover for Boolean BI (Q2931798) (← links)
- An Evaluation Based Theorem Prover (Q3681965) (← links)
- A mechanical proof of the Church-Rosser theorem (Q3801105) (← links)
- Foundations of a theorem prover for functional and mathematical uses (Q4275695) (← links)
- Theorem Proving in Higher Order Logics (Q5477663) (← links)
- A machine program for theorem-proving (Q5621961) (← links)
