Download Article
Download the full article as a PDF file.
The Gödel Completeness Theorem for Uncountable Languages
By: Julian J. Schlöder and Peter Koepke
Open Access
|Feb 2013Language: English
Page range: 199 - 203
Published on: Feb 2, 2013
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2013 Julian J. Schlöder, Peter Koepke, published by University of Białystok
This work is licensed under the Creative Commons License.