Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form

DOI10.3103/S1055134418020013zbMath1413.03003OpenAlexW2807075722MaRDI QIDQ4558324

Aleksandr Sergeevich Gerasimov

Publication date: 21 November 2018

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1055134418020013

zbMATH Keywords

fuzzy logichypersequent calculusproof search algorithminfinite-valued first-order Łukasiewicz logicrational first-order Pavelka logic

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Many-valued logic (03B50)

Related Items

Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic, Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual tableaux. Foundations, methodology, case studies
• A Gray code for set partitions
• Metamathematics of fuzzy logic
• The liberalized \(\delta\)-rule in free variable semantic tableaux
• Proof search and co-NP completeness for many-valued logics
• Level logics
• Untersuchungen über das logische Schliessen. II
• The Skolem method in intuitionistic calculi
• Free-variable semantic tableaux for the logic of fuzzy inequalities
• Proof theory for fuzzy logics
• Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic