A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic

Arnon Avron. A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. Journal of Logic and Computation, 21(5):813-821, 2011. [doi]

@article{Avron11,
  title = {A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic},
  author = {Arnon Avron},
  year = {2011},
  doi = {10.1093/logcom/exp055},
  url = {http://dx.doi.org/10.1093/logcom/exp055},
  researchr = {https://researchr.org/publication/Avron11},
  cites = {0},
  citedby = {0},
  journal = {Journal of Logic and Computation},
  volume = {21},
  number = {5},
  pages = {813-821},
}