Proof theory for fuzzy logics
The class of mathematical fuzzy logics is a natural extension of the class of t-norm-based \([0,1]\)-valued logics. The investigation of these logics started with \textit{P. Hájek}'s seminal monograph [Metamathematics of fuzzy logic. Dordrecht: Kluwer Academic Publishers (1998; Zbl 0937.03030)], which developed the logic of all continuous t-norms. The core basic examples are the infinite-valued Gödel and Łukasiewicz logics, and the product logic. All these fuzzy logics usually are determined by algebraic semantics, and have adequate and rather natural axiomatizations by Hilbert-type calculi, sometimes, however, with infinitary deduction rules. After a careful explanation of these basic facts, the present monograph offers a study of proof-theoretically more interesting Gentzen-type calculi for such logics. However, one has to use hypersequents instead of ordinary sequents, to get suitable, adequate axiomatizations. Nevertheless, only for some of these mathematical fuzzy logics, Gentzen-type axiomatizations are known, particularly for the core ones. Main emphasis here is upon the propositional logics. But there is also a chapter on Gentzen-type calculi for first-order fuzzy logics focussing on analogues of the usual Herbrand theorem and Skolemization. This monograph is a well readable and up-to-date presentation of its topic, which clearly indicates which interesting results have been proved, but which also shows how much remains to be done. It is excellently written by some of the leading experts in the field.
- Mathematical Fuzzy Logics
- Metamathematics of fuzzy logic
- scientific article; zbMATH DE number 2177629
- On theories and models in fuzzy predicate logics
- Mathematical fuzzy logic as a tool for the treatment of vague information
- scientific article; zbMATH DE number 1790409
- Fuzzy logics based on \([0,1)\)-continuous uninorms
- scientific article; zbMATH DE number 956587
- scientific article; zbMATH DE number 1293548
- Computational complexity of t-norm based propositional fuzzy logics with rational truth constants
- Giles's game and the proof theory of Łukasiewicz logic
- Fuzzy refutations for probability and multivalued logics
- A cut-free calculus for second-order Gödel logic
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- Density revisited
- Expressivity in chain-based modal logics
- Implicational (semilinear) logics. III: Completeness properties
- Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
- \(\mathrm{IKT}^\omega\) and Łukasiewicz-models
- Semilinear substructural logics with the finite embeddability property
- Fuzzy sets and formal logics
- From games to truth functions: a generalization of Giles's game
- A generalized proof-theoretic approach to logical argumentation based on hypersequents
- On the construction of uninorms on bounded lattices
- Paraconsistent Gödel modal logic
- Leśniewski's ontology -- proof-theoretic characterization
- Constraint tableaux for two-dimensional fuzzy logics
- Basing sequent systems on exclusive-or
- Proof theory of paraconsistent weak Kleene logic
- Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic
- Hypersequent and display calculi -- a unified perspective
- Triangular norm based predicate fuzzy logics
- New complexity results for Łukasiewicz logic
- Proof of theorems in fuzzy logic based on structural resolution
- The logic of pseudo-uninorms and their residua
- Logics for finite \(\mathbf{UL}\) and \(\mathbf{IUL}\)-algebras are substructural fuzzy logics
- A proof of the standard completeness for the involutive uninorm logic
- Free-variable semantic tableaux for the logic of fuzzy inequalities
- Weakening-free fuzzy logics with the connective \(\Delta\)
- Fuzzy Horn logic. I. Proof theory.
- A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts
- Free modal Riesz spaces are Archimedean: a syntactic proof
- Densification of FL chains via residuated frames
- scientific article; zbMATH DE number 1670477 (Why is no real title available?)
- Cut elimination for Gödel logic with an operator adding a constant
- The finite model property for semilinear substructural logics
- Proof theory for lattice-ordered groups
- Hypersequent calculi for S5: the methods of cut elimination
- A multiple-conclusion calculus for first-order Gödel logic
- scientific article; zbMATH DE number 2177629 (Why is no real title available?)
- A co-inductive language and truth degrees
- ST, LP and tolerant metainferences
- A standard internal calculus for Lewis' counterfactual logics
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- Proof theory for locally finite many-valued logics: semi-projective logics
- On an axiomatic system for the logic of linearly ordered BCI-matrices
- scientific article; zbMATH DE number 1222563 (Why is no real title available?)
- The standard completeness of interval-valued monoidal t-norm based logic
- Infinite-valued first-order Łukasiewicz logic: hypersequent calculi without structural rules and proof search for sentences in the prenex form
- Judgement aggregation in non-classical logics
- Cut elimination theorem for non-commutative hypersequent calculus
- scientific article; zbMATH DE number 764344 (Why is no real title available?)
- Fuzzy logics and fuzzy model theory
- Free Definite Description Theory – Sequent Calculi and Cut Elimination
- Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
- Comments on the Papers
- Proof theory of Riesz spaces and modal Riesz spaces
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- Fregean Description Theory in Proof-Theoretical Setting
- CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH
- Rational Pavelka logic: the best among three worlds?
- FFNSL: Feed-forward neural-symbolic learner
- Glivenko sequent classes and constructive cut elimination in geometric logics
- Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic
- Many-valued logic and sequence arguments in value theory
- Dual tableau for monoidal triangular norm logic MTL
- Effectiveness in RPL, with applications to continuous logic
- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
- A cut-free, sound and complete Russellian theory of definite descriptions
- Linear abelian modal logic
- An order induced by the direct product of t-norms
- Basic substructural core fuzzy logics and their extensions: mianorm-based logics
- Basic semilinear logics based on \([0,u]\)-continuous uwa-uninorms
- Weak associative micanorm-based logics: \([0, e]\)-continuous \(\nu\)-weak-associative logics
- Many-valued modal logic
- Uninorm logic with the \(n\)-potency axiom
- Deprenexification in analytic calculi for first-order rational Pavelka logic
- A fuzzy proof theory
- A note on standard completeness for some extensions of uninorm logic
- Logic of approximate entailment in quasimetric spaces
This page was built for publication: Proof theory for fuzzy logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519539)
