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

Authors:
Matthias Baaz;Agata Ciabattoni;Christian G. Fermüller
Affiliations:
Technische Universität Wien, Austria;Technische Universität Wien, Austria;Technische Universität Wien, Austria
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 10
Cited 1

The method of hypersequents in the proof theory of propositional non-classical logics

Logic: from foundations to applications
The resolution calculus

The resolution calculus
Cut-elimination and redundancy-elimination by resolution

Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
Basic proof theory (2nd ed.)

Basic proof theory (2nd ed.)
Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
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
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
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
CERES: An analysis of Fürstenberg's proof of the infinity of primes

Theoretical Computer Science
Towards a clausal analysis of cut-elimination

Journal of Symbolic Computation

Atomic cut introduction by resolution: proof structuring and compression

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient, automated elimination of cuts is a prerequisite for proof analysis. The method CERES, based on Skolemization and resolution has been successfully developed for classical logic for this purpose. We generalize this method to Gödel logic, an important intermediate logic, which is also one of the main formalizations of fuzzy logic.