An elementary proof of chang's completeness theorem for the infinite-valued calculus of Łukasiewicz
The interpretation of propositions in Łukasiewicz's infinite-valued calculus as answers in Ulam's game with lies-the Boolean case corresponding to the traditional Twenty Questions game-gives added interest to the completeness theorem. The literature contains several different proofs, but t...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00393215_v58_n1_p79_Cignoli |
| Aporte de: |
| Sumario: | The interpretation of propositions in Łukasiewicz's infinite-valued calculus as answers in Ulam's game with lies-the Boolean case corresponding to the traditional Twenty Questions game-gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces. © 1997 Kluwer Academic Publishers. |
|---|