T-string unification: Unifying prefixes in non-classical proof methods
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 244-260
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A connection based proof method for intuitionistic logicLecture Notes in Computer Science, 1995
- LeanT A P: Lean tableau-based theorem provingLecture Notes in Computer Science, 1994
- KoMeTLecture Notes in Computer Science, 1994
- SETHEO: A high-performance theorem proverJournal of Automated Reasoning, 1992
- Automated reasoning contributes to mathematics and logic1990
- Automated Theorem Proving1987
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- On Matrices with ConnectionsJournal of the ACM, 1981
- Logical Writings1971
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965