Cut Elimination for First Order Gödel Logic by Hyperclause Resolution

DOI10.1007/978-3-540-89439-1_32MaRDI QIDQ5505574zbMATH OpenOpenAlexFDO

Authors Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89439-1_32

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Mechanization of proofs and logical operations (03B35)

Recommendations

• Methods of cut-elimination
• Cut-elimination: syntax and semantics
• Towards a clausal analysis of cut-elimination
• scientific article; zbMATH DE number 1950251
• Logic for Programming, Artificial Intelligence, and Reasoning

Cited in

(13)

• Ceres in intuitionistic logic
• A cut-free calculus for second-order Gödel logic
• scientific article; zbMATH DE number 777292 (Why is no real title available?)
• A semantic proof of strong cut-admissibility for first-order Godel logic
• Automated deduction in Gödel logic
• Methods of cut-elimination
• Cut-elimination: syntax and semantics
• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
• Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination
• Optimization in temporal qualitative constraint networks
• scientific article; zbMATH DE number 1950251 (Why is no real title available?)
• CERES in higher-order logic
• Cut elimination for Gödel logic with an operator adding a constant

This page was built for publication: Cut Elimination for First Order Gödel Logic by Hyperclause Resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505574)