A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
From MaRDI portal
Publication:3097870
DOI10.1093/logcom/exp055zbMath1258.03026OpenAlexW1991664539MaRDI QIDQ3097870
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
Related Items
LINEAR TIME IN HYPERSEQUENT FRAMEWORK, Hypersequent Calculi for S5: The Methods of Cut Elimination, A Multiple-Conclusion Calculus for First-Order Gödel Logic