A semantic proof of strong cut-admissibility for first-order Godel logic
type: Item
instance of: scholarly article
title: A semantic proof of strong cut-admissibility for first-order Godel logic
zbMATH Open document ID: 1284.03255
author: Ori Lahav
author: Arnon Avron
publication date: 2013-04-19T00:00:00Z
Mathematics Subject Classification ID: 03F05
Mathematics Subject Classification ID: 03B52
Mathematics Subject Classification ID: 03B55
zbMATH DE Number: 6155649
zbMATH Keywords: proof-theory
zbMATH Keywords: nonclassical logic
zbMATH Keywords: intermediate logic
zbMATH Keywords: fuzzy logic
zbMATH Keywords: first-order Gödel logic
zbMATH Keywords: hypersequents
zbMATH Keywords: semantic proof
zbMATH Keywords: cut-admissibility
MaRDI profile type: Publication
full work available at URL: exs006
OpenAlex ID: W2032767961
DOI: 10.1093/LOGCOM/EXS006
published in: Journal Of Logic And Computation
Recommended article: Q4412849
Recommended article: A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
Recommended article: Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
Recommended article: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
Recommended article: First-order Gödel logics
Recommended article: A cut-free calculus for second-order Gödel logic
Recommended article: A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
Recommended article: Compactness in first-order Godel logics
Recommended article: A Multiple-Conclusion Calculus for First-Order Gödel Logic
Recommended article: On the classification of first order Gödel logics
description: scientific article; zbMATH DE number 6155649