A semantic proof of strong cut-admissibility for first-order Godel logic

DOI10.1093/LOGCOM/EXS006zbMath1284.03255OpenAlexW2032767961MaRDI QIDQ4914412

Ori Lahav, Arnon Avron

Publication date: 19 April 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exs006

zbMATH Keywords

fuzzy logicnonclassical logicintermediate logichypersequentsfirst-order Gödel logicproof-theorycut-admissibilitysemantic proof

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: A semantic proof of strong cut-admissibility for first-order Godel logic