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
    Buss's proof of PHP_n in P_1 encodes induction over sharp... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The system P_1 admits proofs of PHP_n of size polynomial in n.

    Buss's proof of PHP_n in P_1 encodes induction over sharply bounded formulas, which presupposes the very combinatorial principles PHP is meant to test.

    ?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.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    The system P_1 admits proofs of PHP_n of size polynomial in n.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.

    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