Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    All provable sentences are true — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→There must be true arithmetical sentences which are not provable

    All provable sentences are true

    Truth & Knowledge
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Topics

    Truth & Knowledge

    Related

    The set of provable sentences in arithmetic and the set of true arithmetical sen...There must be true arithmetical sentences which are not provable

    Similar

    By the Completeness Theorem, provable sentences are valid, but not all...91%

    Next step

    Based on where you are in your exploration

    Browse more in Truth & Knowledge
    Related propositions within the same area of thought.
    These sentences are true87%
    The Gödel sentence G_F is true (when F is consistent and the provabili...84%
    If Cons(F) were provable in F, then the Gödel sentence G_F would also ...83%

    Source

    AI-extracted
    SEP: goedel-incompleteness
    View source passageHide passage
    Be that as it may, it seems that Gödel actually arrived at the first exact observations about incompleteness via a different route, during his attempts to contribute to Hilbert’s program, and not to undermine it (see Dawson 1997: Ch. IV). Namely, in 1930, Gödel made an effort to advance Hilbert’s program by attempting to prove the consistency of analysis (or, second-order arithmetic) with the resources of arithmetic, and thus reduce the consistency of the former to the consistency of the latter.

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective