The Gödel Completeness Theorem for Uncountable Languages

Julian J. Schlöder, Peter Koepke. The Gödel Completeness Theorem for Uncountable Languages. Formalized Mathematics, 20(3):199-203, 2012. [doi]

@article{SchloderK12a,
  title = {The Gödel Completeness Theorem for Uncountable Languages},
  author = {Julian J. Schlöder and Peter Koepke},
  year = {2012},
  url = {http://www.degruyter.com/view/j/forma.2012.20.issue-3/v10037-012-0023-z/v10037-012-0023-z.xml},
  researchr = {https://researchr.org/publication/SchloderK12a},
  cites = {0},
  citedby = {0},
  journal = {Formalized Mathematics},
  volume = {20},
  number = {3},
  pages = {199-203},
}