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

DOI10.1007/978-3-540-89439-1_32zbMATH Open1182.03102OpenAlexW1564824837MaRDI QIDQ5505574FDOQ5505574

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

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

Mathematics Subject Classification ID

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

Cited In (13)

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

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)