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 The Curry-Howard correspondence maps proof *structures*, but classical logic proofs lack the constructive witnesses required for type inhabitation.

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

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Classical logic can be embedded in intuitionistic logic via CPS translation; proofs still correspond to types, just indirectly.
      ?

      Think about whether this reason is strong or weak

    • 2.Curry-Howard applies to classical systems too (e.g., call/cc in typed languages), mapping to control operators rather than pure lambdas.
      ?

      Think about whether this reason is strong or weak

    • 3.The claim conflates 'lacks direct witnesses' with 'lacks type inhabitation'—these are different properties; classical proofs inhabit different type structures.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Classical proofs use excluded middle and indirect arguments that don't construct explicit witnesses needed for computational type inhabitation.
      ?

      Think about whether this reason is strong or weak

    • 2.Intuitionistic logic naturally produces lambda terms; classical logic requires double-negation elimination, which lacks direct computational content.
      ?

      Think about whether this reason is strong or weak

    • 3.Type theory interprets proofs as programs, but classical tautologies like (P∨¬P) don't yield computable functions without additional axioms.
      ?

      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.