Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic
From MaRDI portal
Publication:6107297
DOI10.12775/llp.2022.030zbMath1530.03107OpenAlexW4309323632MaRDI QIDQ6107297
Aleksandr Sergeevich Gerasimov
Publication date: 3 July 2023
Published in: Logic and Logical Philosophy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.12775/llp.2022.030
proof theorymany-valued logicconservative extensionmathematical fuzzy logicdensity eliminationHilbert-type calculusfirst-order infinite-valued Łukasiewicz logicfirst-order rational Pavelka logicGentzen-type hypersequent calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform proofs of standard completeness for extensions of first-order MTL
- A note on standard completeness for some extensions of uninorm logic
- Density elimination
- Metamathematics of fuzzy logic
- Density revisited
- Algebraic foundations of many-valued reasoning
- Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic
- The logic of pseudo-uninorms and their residua
- A proof of the standard completeness for the involutive uninorm logic
- Free-variable semantic tableaux for the logic of fuzzy inequalities
- Proof theory for fuzzy logics
- Standard Completeness for Extensions of MTL: An Automated Approach
- A New Proof of the Completeness of the Lukasiewicz Axioms
- Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
- Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
- Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form
- Hypersequent Calculi for Godel Logics -- a Survey
- Automated Reasoning with Analytic Tableaux and Related Methods
- Substructural fuzzy logics
