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
    Hilbert's program and its successors (e.g., Detlefsen's '... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The Gödel sentence G_F is true (when F is consistent and the provability predicate is a Σ⁰₁-formula)

    Hilbert's program and its successors (e.g., Detlefsen's 'Hilbertian instrumentalism') deny that unprovability-relative-to-F licenses truth-attribution absent an independent consistency proof.

    ?Rate how convincing each reason is below to see the overall strength.
    1 reason for
    1 reason against

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Gödel's incompleteness theorems show formal systems cannot prove their own consistency, making unprovability within F epistemically unreliable.
      ?

      Think about whether this reason is strong or weak

    • 2.Truth-attributions to unprovable statements risk conflating mathematical with metaphysical claims without justification.
      ?

      Think about whether this reason is strong or weak

    • 3.Requiring independent consistency proofs prevents circular reasoning and grounds mathematical knowledge in constructive verification.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.The demand for independent consistency proofs faces infinite regress: any proof requires its own consistency verification.
      ?

      Think about whether this reason is strong or weak

    • 2.Mathematical practice routinely treats unprovable-in-F statements as true (e.g., Con(PA)) without Hilbertian skepticism causing problems.
      ?

      Think about whether this reason is strong or weak

    • 3.Denying truth to unprovable statements makes mathematics epistemically parochial, unable to accommodate transfinite reasoning's genuine utility.
      ?

      Think about whether this reason is strong or weak

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

    Next step

    Based on where you are in your exploration

    Strongest counterpoint
    Explore the most compelling reason on the other side.

    Key Terms

    Consistency proof(the main subject of this statement)
    A logical demonstration that a system of rules or statements doesn't contain any contradictions—that you can't derive both a statement and its opposite using those rules.
    Detlefsen(as a philosopher's name)
    Michael Detlefsen is a contemporary philosopher who studies the philosophy of mathematics and has developed modern versions of Hilbert's ideas.
    Hilbert's program(Gödel's incompleteness work arose from attempts to contribute to, not undermine, this program)
    A project to secure the foundations of mathematics by proving the consistency of stronger mathematical systems using the resources of weaker, more elementary systems
    Hilbertian instrumentalism(as a philosophical position about mathematics)
    The view that mathematical statements are useful tools for making predictions and organizing our thinking, rather than statements about things that actually exist.
    Licenses truth-attribution(as an epistemological concept)
    Gives you the right or justification to claim that something is actually true.
    Relative-to-F(as mathematical notation shorthand)
    Meaning 'within a specific formal system or set of rules' (where F stands for a formal system like the rules of arithmetic).
    Unprovability(describing mathematical claims that cannot be established as true)
    The quality of a statement that cannot be logically proven true using the accepted rules and facts of a system, like a math problem that has no solution.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    Denying truth to unprovable statements makes mathematics epistemically parochial...Gödel's incompleteness theorems show formal systems cannot prove their own consi...

    Details

    Type
    claim
    Perspectives
    2 (1 for, 1 against)
    Edits
    1 edit
    Mathematical practice routinely treats unprovable-in-F statements as true (e.g.,...
    Requiring independent consistency proofs prevents circular reasoning and grounds...
    +3 moreShow less
    The Gödel sentence G_F is true (when F is consistent and the provability predica...The demand for independent consistency proofs faces infinite regress: any proof ...Truth-attributions to unprovable statements risk conflating mathematical with me...