Deciding the \(E^+\)-class by an a posteriori, liftable order

DOI10.1016/S0168-0072(00)00013-0zbMath0966.03012OpenAlexW2010309877WikidataQ127592956 ScholiaQ127592956MaRDI QIDQ1577484

Hans de Nivelle

Publication date: 26 July 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(00)00013-0

zbMATH Keywords

decidable classestheorem-proving\(E^+\)-classliftable order

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (1)

A resolution-based decision procedure for \({\mathcal{SHOIQ}}\).

Uses Software

• OTTER
• SPASS
• FLOTTER

Cites Work

• On a bound for the complexity of terms in the resolution method
• Resolution methods for the decision problem
• Resolution Strategies as Decision Procedures
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding the \(E^+\)-class by an a posteriori, liftable order