Proof theory for fuzzy logics

From MaRDI portal
Revision as of 04:49, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2519539


DOI10.1007/978-1-4020-9409-5zbMath1168.03002MaRDI QIDQ2519539

George Metcalfe, Nicola Olivetti, Dov M. Gabbay

Publication date: 26 January 2009

Published in: Applied Logic Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-9409-5


03B52: Fuzzy logic; logic of vagueness

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

03B50: Many-valued logic

03F03: Proof theory in general (including proof-theoretic semantics)


Related Items

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, Unnamed Item, 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, 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, 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, Densification of FL chains via residuated frames, Proof theory for lattice-ordered groups, Proof theory for locally finite many-valued logics: semi-projective logics, On an axiomatic system for the logic of linearly ordered BCI-matrices, The standard completeness of interval-valued monoidal t-norm based logic, Fuzzy logics and fuzzy model theory, Dual tableau for monoidal triangular norm logic MTL, Effectiveness in RPL, with applications to continuous logic, Basic substructural core fuzzy logics and their extensions: mianorm-based logics, Uninorm logic with the \(n\)-potency axiom, A note on standard completeness for some extensions of uninorm logic, Logic of approximate entailment in quasimetric spaces, Giles's game and the proof theory of Łukasiewicz logic, 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, 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\), 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, Cut Elimination for Gödel Logic with an Operator Adding a Constant, The finite model property for semilinear substructural logics, Hypersequent Calculi for S5: The Methods of Cut Elimination, A Multiple-Conclusion Calculus for First-Order Gödel Logic, 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