Change search
Refine search result
1 - 1 of 1
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Granberg Olsson, Mattias
    Stockholm University, Faculty of Science, Department of Mathematics.
    A Model-Theoretic Proof of Gödel's Theorem: Kripke's Notion of Fulfilment2017Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The notion of fulfilment of a formula by a sequence of numbers, an approximation of truth due to Kripke, is presented and subsequently formalised in the weak arithmetic theory IΣ1, in some detail. After a number of technical results connecting the formalised notion to the meta-theoretical one a version of Gödel’s Incompleteness Theorem, that no consistent, recursively axiomatisable, Σ2-sound extension T of Peano arithmetic is complete, is shown by construction of a true Π2-sentence and a model of T where it is false, yielding its independence from T. These results are then generalised to a more general notion of fulfilment, proving that IΣ1 has no complete, consistent, recursively axiomatisable, Σ2-sound extensions by a similar construction of an independent sentence. This generalisation comes at the cost of some naturality, however, and an explicit falsifying model will only be obtained under additional assumptions.

    The aim of the thesis is to reproduce in some detail the notions and results developed by Kripke and Quinsey and presented by Quinsey and Putnam. In particular no novel results are obtained.

1 - 1 of 1
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf