Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A repetition-free hypersequent calculus for first-order rational Pavelka logic (1812.04861v2)

Published 12 Dec 2018 in cs.LO

Abstract: We present a hypersequent calculus $\text{G}3\text{\L}\forall$ for first-order infinite-valued {\L}ukasiewicz logic and for an extension of it, first-order rational Pavelka logic; the calculus is intended for bottom-up proof search. In $\text{G}3\text{\L}\forall$, 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 $\text{G}3\text{\L}\forall$ 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 $\text{G}3\text{\L}\forall$ and thereby provide foundations for proof search algorithms.

Citations (2)

Summary

We haven't generated a summary for this paper yet.