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
    Without classical negation, the absence of a proof of φ d... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Player ∃ has a winning strategy in G(¬φ) if and only if player ∃ does not have a winning strategy in G(φ).

    Without classical negation, the absence of a proof of φ does not constructively yield a proof of ¬φ, so the biconditional holds only under classical assumptions the claim silently imports.

    ?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

    Biconditional(in formal logic)
    A logical statement that says two things are true if and only if each other is true; it's a two-way relationship (like saying 'you can vote if and only if you're 18').
    Classical assumptions(what constructive logic challenges)
    The traditional rules of logic that have been used for centuries, which assume that every statement is either completely true or completely false.
    Classical negation(contrasted with constructive logic)
    The traditional logical rule that says if something is not true, then its opposite must be true—like how something is either raining or not raining, with no middle ground.
    Constructively(describing how proof works in constructive logic)
    In a way that requires actually building or demonstrating something with concrete steps, rather than just assuming it's true based on logical rules alone.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    proof(Frege's formal system; the definition still used by logicians today)
    Any finite sequence of statements such that each statement is either an axiom of the formal system or follows from previous members of the sequence by a valid rule of inference.
    φ (phi) and ¬φ(logical notation in the statement)
    Symbols used as placeholders: φ stands for any statement (like 'it is raining'), and ¬φ means 'not φ' (like 'it is not raining').

    Connections

    2 topics

    Truth & Knowledge1 linkedPhilosophy of Language1 linked

    Related

    Player ∃ has a winning strategy in G(¬φ) if and only if player ∃ does not have a...

    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