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
    Under a proof-theoretic interpretation, a logic is unders... — Carmelics
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→When logic is understood proof-theoretically rather than model-theoretically, the validity problem coincides with derivability

    Under a proof-theoretic interpretation, a logic is understood as the set of formulas derivable from some set of axioms

    Philosophy of LanguageTruth & 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

    Philosophy of LanguageTruth & Knowledge

    Connections

    1 topic

    Modality & Possibility1 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.
    Under this interpretation, the validity problem becomes the problem of deciding ...When logic is understood proof-theoretically rather than model-theoretically, th...

    Similar

    When logic is understood proof-theoretically rather than model-theoret...85%A logic can be defined as a triple consisting of a set of formulas, a ...84%Hoare logic is a true logic of programs, not merely a proof method83%Epistemic logic is a suitable formal framework for representing episte...83%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    It thus seems reasonable to summarize the current status of the \(\textbf{P} \neq \textbf{NP}\)? problem as follows: (i) \(\textbf{P} \neq \textbf{NP}\) is widely believed to be true on the basis of convergent inductive and heuristic evidence; (ii) we currently have no reason to suspect that this statement is formally independent of the mathematical theories which we accept in practice; but (iii) a proof \(\textbf{P} \neq \textbf{NP}\) is still considered to be beyond the reach of current techni

    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