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
    A statement that systematically evades all current proof ... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→P ≠ NP is unlikely to be independent of strong formal theories such as PA or ZFC

    A statement that systematically evades all current proof strategies within a formal system is precisely the kind of statement independence results historically attach to, as Gödel's original incompleteness construction illustrates.

    ?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

    Formal system(as used in logic and mathematics)
    A set of rules and symbols (like mathematical axioms) that you use to prove whether statements are true or false, similar to how a chess game has specific rules that determine what moves are legal.
    Gödel's incompleteness(as used in mathematical logic and philosophy of mathematics)
    A groundbreaking discovery by mathematician Kurt Gödel proving that any logical system powerful enough to do basic math will always contain some true statements that cannot be proven using that system's own rules.
    Independence results(as used in mathematical logic)
    Mathematical discoveries showing that certain statements cannot be proven true or false using a particular system's rules—they're neither provable nor disprovable within that system.
    Kurt Gödel(the mathematician who disproved Hilbert)
    An Austrian-American logician (1906-1978) who proved shocking theorems showing that any complex formal system has true statements that cannot be proven using the system's own rules.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Proof strategies(as used in mathematics and logic)
    Methods or techniques used to demonstrate that a statement is definitely true based on the rules of a formal system.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    P ≠ NP is unlikely to be independent of strong formal theories such as PA or ZFC

    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