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 Haken's 1985 proof relies on a specific syntactic formalization of PHP_n; alternative encodings may yield structurally distinct tautologies with shorter proofs.

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

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Haken's exponential lower bound applies to the *formula class* PHP_n itself, not just one syntactic instance—alternative encodings are equivalent.
      ?

      Think about whether this reason is strong or weak

    • 2.No alternative encoding has demonstrated substantially shorter proofs in practice; marginal syntactic improvements don't overcome the fundamental barrier.
      ?

      Think about whether this reason is strong or weak

    • 3.The claim conflates encoding variations (which exist) with proof-theoretic hardness (which is invariant across reasonable formalizations).
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Proof length depends on syntactic choices: different variable orderings and clause representations demonstrably affect resolution proof size.
      ?

      Think about whether this reason is strong or weak

    • 2.PHP has multiple logically equivalent formalizations; some encodings may distribute the pigeonhole constraint more efficiently than others.
      ?

      Think about whether this reason is strong or weak

    • 3.Haken's lower bound applies to *specific* proof systems and encodings, not to all possible representations of the same logical content.
      ?

      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.