| dc.date.accessioned | 2013-03-12T08:03:30Z | |
| dc.date.available | 2013-03-12T08:03:30Z | |
| dc.date.issued | 2004 | en_US |
| dc.date.submitted | 2008-02-29 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10852/9833 | |
| dc.description.abstract | In the famous paper of Kurt Gödel he proved that number theory, containing axioms for addition and multiplication is incomplete. But what about simpler theories? Are they complete? The answer is yes. The theories of addition and multiplication are both complete, but the argument that they are decidable is far from trivial. In the following essay we shall present the weak fragments of number theory and outline the proofs why they provide an algorithm answering yes or no on questions about truth. | nor |
| dc.language.iso | eng | en_US |
| dc.relation.ispartof | Research report http://urn.nb.no/URN:NBN:no-35645 | en_US |
| dc.relation.uri | http://urn.nb.no/URN:NBN:no-35645 | |
| dc.title | Complete fragments of arithmetic | en_US |
| dc.type | Research report | en_US |
| dc.date.updated | 2008-03-04 | en_US |
| dc.creator.author | Hagalisletto, Anders Moen | en_US |
| dc.subject.nsi | VDP::420 | en_US |
| dc.identifier.urn | URN:NBN:no-18691 | en_US |
| dc.type.document | Forskningsrapport | en_US |
| dc.identifier.duo | 70691 | en_US |
| dc.identifier.bibsys | 080352561 | en_US |
| dc.identifier.fulltext | Fulltext https://www.duo.uio.no/bitstream/handle/10852/9833/1/Report-No317.pdf | |