A cut-free calculus for second-order Gödel logic

DOI10.1016/j.fss.2015.01.017zbMath1388.03030OpenAlexW2023659949MaRDI QIDQ1677040

Arnon Avron, Ori Lahav

Publication date: 10 November 2017

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2015.01.017

zbMATH Keywords

proof theorysecond-order logicGödel logicnon-classical logicsfuzzy logicsnon-deterministic semanticscut-admissibility

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Cut-elimination and normal-form theorems (03F05)

Related Items

Compositional meaning in logic, On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On fuzzy type theory
• Metamathematics of fuzzy logic
• Hypersequents, logical consequence and intermediate logics for concurrency
• Fuzzy class theory
• Proof theory for fuzzy logics
• A proof of cut-elimination theorem in simple type-theory
• Semantic investigation of canonical Gödel hypersequent systems
• Herbrand Theorems for Substructural Logics
• Canonical calculi with (n,k)-ary quantifiers
• Syntactical and semantical properties of simple type theory
• Hypersequent Calculi for Godel Logics -- a Survey
• A semantic proof of strong cut-admissibility for first-order Godel logic
• Hauptsatz for higher order logic
• A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic
• Proof theory