Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Müller, Sandra, Sargsyan, Grigor
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2412.07325
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929626647887872
author Müller, Sandra
Sargsyan, Grigor
author_facet Müller, Sandra
Sargsyan, Grigor
contents Gödel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum Hypothesis is consistent. Afterwards, Gödel raised the question whether, despite the fact that there is no reasonable axiomatic framework for all mathematical statements, natural statements, such as Cantor's Continuum Hypothesis, can be decided via extending ZFC by large cardinal axioms. While this question has been answered negatively, the problem of finding good axioms that decide natural mathematical statements remains open. There is a compelling candidate for an axiom that could solve Gödel's problem: V = Ultimate-L. In addition, due to recent results the Sealing scenario has gained a lot of attention. We describe these candidates as well as their impact and relationship.
format Preprint
id arxiv_https___arxiv_org_abs_2412_07325
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Gödel's Program in Set Theory
Müller, Sandra
Sargsyan, Grigor
Logic
Gödel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum Hypothesis is consistent. Afterwards, Gödel raised the question whether, despite the fact that there is no reasonable axiomatic framework for all mathematical statements, natural statements, such as Cantor's Continuum Hypothesis, can be decided via extending ZFC by large cardinal axioms. While this question has been answered negatively, the problem of finding good axioms that decide natural mathematical statements remains open. There is a compelling candidate for an axiom that could solve Gödel's problem: V = Ultimate-L. In addition, due to recent results the Sealing scenario has gained a lot of attention. We describe these candidates as well as their impact and relationship.
title Gödel's Program in Set Theory
topic Logic
url https://arxiv.org/abs/2412.07325