Abstract
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.
Cite
CITATION STYLE
Baaz, M., Ciabattoni, A., & Fermüller, C. G. (2001). Herbrand’s Theorem for prenex Gödel logic and its consequences for theorem proving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2250, pp. 201–216). Springer Verlag. https://doi.org/10.1007/3-540-45653-8_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
