A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic

DOI10.1093/LOGCOM/EXP055zbMath1258.03026OpenAlexW1991664539MaRDI QIDQ3097870

Arnon Avron

Publication date: 10 November 2011

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

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

zbMATH Keywords

completenesshypersequentsstrong cut-eliminationpropositional Gödel logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Many-valued logic (03B50)

Related Items (3)

LINEAR TIME IN HYPERSEQUENT FRAMEWORK ⋮ Hypersequent Calculi for S5: The Methods of Cut Elimination ⋮ A Multiple-Conclusion Calculus for First-Order Gödel Logic

This page was built for publication: A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic