Non-Standard Models for Formal Languages.
The well known Incompleteness Theorem of Godel showed that for any formal axiomatic system S which is adequate for number theory there exists a proposition expressible in S which is undecidable in S. That a proposition expressible in a system is independent of the axioms of the system is not a remar...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1955
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=109996 |