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
    Home/Original/inverse
    See Original
    Inverse View

    It is not the case that Gödel's incompleteness results establish that some true statements are unprovable, meaning P≠NP may be true but its truth undecidable within standard axiomatic systems.

    ?Set your confidence on the premises below to see your aggregate.

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Gödel's results apply to formal systems; P vs NP is a concrete combinatorial claim about integer complexity—likely decidable in principle.
      ?

      Think about whether this reason is strong or weak

    • 2.No evidence suggests P vs NP is independent of ZFC; conflating logical undecidability with practical unsolvability confuses two different claims.
      ?

      Think about whether this reason is strong or weak

    • 3.If P≠NP is true, it remains true regardless of provability; calling it 'undecidable' conflates metaphysical truth with epistemological access.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Gödel proved that consistent formal systems cannot prove all truths within their domain, establishing precedent for true unprovable statements.
      ?

      Think about whether this reason is strong or weak

    • 2.P vs NP is a deep mathematical question; if it's independent of ZFC, standard methods cannot resolve it, leaving truth undecidable.
      ?

      Think about whether this reason is strong or weak

    • 3.Many natural mathematical questions (continuum hypothesis) are undecidable in standard systems, making P≠NP independence plausible.
      ?

      Think about whether this reason is strong or weak

    Next step

    Based on where you are in your exploration

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