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
    Haken (1985) showed that any resolution proof of PHP_n mu... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Resolution is not polynomially bounded as a proof system

    Haken (1985) showed that any resolution proof of PHP_n must have size at least exponential in n

    All sources support itTruth & Knowledge
    ?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.

    Topics

    Truth & KnowledgeAll sources support it

    Connections

    2 topics

    Modality & Possibility3 linked

    Next step

    Based on where you are in your exploration

    Browse more in Truth & Knowledge
    Related propositions within the same area of thought.
    Proof of definition segments
    1 linked

    Related

    A proof system is polynomially bounded only if all tautologies of size n possess...PHP_n is a tautology for each n and hence provable in any complete proof system ...Resolution is not polynomially bounded as a proof systemThe Pigeonhole Principle formula PHP_n is a tautology for each n and is provable...

    Similar

    Any resolution proof of PHP_n must have size at least exponential in n...97%Buss (1987) showed that P1 admits proofs of PHP_n of size polynomial i...84%Buss (1987) demonstrated that P_1 has polynomial-size proofs of PHP_n.83%P_1 admits polynomial-size proofs of PHP_n.79%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    as the set of formulas derivable from some set of axioms of \(\Gamma_{\mathcal{L}}\) rather than the class of formulas true in all structures – the validity problem is understood to coincide with the problem of deciding whether \(\phi\) is derivable from \(\Gamma_{\mathcal{L}}\). In such cases, the satisfiability and model checking problems are generally not considered. The problems \(\sc{SATISFIABILITY}_{\mathcal{L}}\), \(\sc{VALIDITY}_{\mathcal{L}}\), and \(\sc{MODEL}\ \sc{CHECKING}_{\mathcal{

    Details

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