DeepAI AI Chat
Log In Sign Up

A repetition-free hypersequent calculus for first-order rational Pavelka logic

by   Alexander S. Gerasimov, et al.

We present a hypersequent calculus G^3Ł∀ for first-order infinite-valued Łukasiewicz logic and for an extension of it, first-order rational Pavelka logic; the calculus is intended for bottom-up proof search. In G^3Ł∀, there are no structural rules, all the rules are invertible, and designations of multisets of formulas are not repeated in any premise of the rules. The calculus G^3Ł∀ proves any sentence that is provable in at least one of the previously known hypersequent calculi for the given logics. We study proof-theoretic properties of G^3Ł∀ and thereby provide foundations for proof search algorithms.


page 1

page 2

page 3

page 4


Automated proof search system for logic of correlated knowledge

The automated proof search system and decidability for logic of correlat...

Comparing several calculi for first-order infinite-valued Łukasiewicz logic

From the viewpoint of provability, we compare some Gentzen-type hyperseq...

Proof Complexity of Substructural Logics

In this paper, we investigate the proof complexity of a wide range of su...

Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules

Chase algorithms are indispensable in the domain of knowledge base query...

Admissible Tools in the Kitchen of Intuitionistic Logic

The usual reading of logical implication "A implies B" as "if A then B" ...

Cirquent calculus in a nutshell

This paper is a brief and informal presentation of cirquent calculus, a ...

An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics

Possibilistic logic, an extension of first-order logic, deals with uncer...