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
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    If we cannot prove consistency from within, the condition... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→A consistent formal system of arithmetic must contain statements that are true but not provable within that system.

    If we cannot prove consistency from within, the conditional 'if consistent, then the Gödel sentence is true' provides no categorical grounds for asserting the sentence's truth—only its truth relative to an assumed but unverifiable hypothesis.

    ?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.

    Key Terms

    Categorical grounds(as opposed to conditional or relative grounds)
    Solid, definite proof or reasons that work on their own, without needing to assume anything else first.
    Conditional statement(the 'if consistent, then...' structure in the quote)
    A 'if-then' claim: 'if X is true, then Y must be true' — it doesn't say X actually IS true, just what follows IF it were.
    Consistency (in logic)(as the property being discussed in the conditional statement)
    When a set of rules or statements don't contradict each other — you can't prove both a statement and its opposite at the same time.
    Gödel(as a historical figure in mathematical logic)
    Kurt Gödel was a 20th-century mathematician and logician who proved that any consistent formal system (a set of logical rules) is incomplete—meaning there are true statements it can't prove.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Gödel sentence(the main subject of the statement)
    A mathematical statement (named after logician Kurt Gödel) that is true but cannot be proven using the rules of a particular logical system.
    Relative truth (truth relative to an assumption)(contrasted with categorical assertion in the statement)
    Something that is only true if you accept a certain starting assumption — not universally or absolutely true on its own.
    Unverifiable hypothesis(as describing the assumption that a system is consistent)
    A starting assumption that you cannot actually test or prove to be true or false.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    A consistent formal system of arithmetic must contain statements that are true b...

    Details

    Type
    claim
    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