A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
The method of hypersequents in the proof theory of propositional non-classical logics
Logic: from foundations to applications
The resolution calculus
Term rewriting and all that
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Quantifier Elimination in Fuzzy Logic
Proceedings of the 12th International Workshop on Computer Science Logic
Ordered Chaining for Total Orderings
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Decidability Problems for the Prenex Fragment of Intuitionistic Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Chaining Techniques for Automated Theorem Proving in Many-Valued Logics
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Quantified propositional Gödel logics
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Proof Theory for First Order Łukasiewicz Logic
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
A resolution mechanism for Prenex Gödel logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Analytic Calculi for Monoidal T-norm Based Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
Herbrand's Theorem for G∞Δ, i.e., Gödel logic enriched by the projection operator Δ is proved. As a consequence we obtain a "chain normal form" and a translation of prenex G∞Δ into (order) clause logic, referring to the classical theory of dense total orders with endpoints. A chaining calculus provides a basis for efficient theorem proving.