Satisfiability of systems of ordinal notations with the subterm property is decidable
Authors:
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 455-468
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- SOLVING SYMBOLIC ORDERING CONSTRAINTSInternational Journal of Foundations of Computer Science, 1990
- Rewrite Systems1990
- A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagramsThe Journal of Symbolic Logic, 1987
- A new method for establishing refutational completeness in theorem proving1986
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proof Theory1977