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
    By the Completeness Theorem, provable sentences are valid... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Internal categoricity is stronger than (mere) categoricity.

    By the Completeness Theorem, provable sentences are valid, but not all valid sentences are provable.

    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

    2 topics

    Modality & Possibility2 linked

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.
    Proof of definition segments
    1 linked

    Related

    Categoricity of θ(P) requires that the sentence categ(θ(P)) is valid (true in al...Internal categoricity is stronger than (mere) categoricity.Internal categoricity of θ(P) requires that categ(θ(P)) is provable.

    Similar

    All provable sentences are true91%If Cons(F) were provable in F, then the Gödel sentence G_F would also ...84%The Gödel sentence G_F is true (when F is consistent and the provabili...83%All sentences asserting their own provability are provable, given a no...83%

    Source

    AI-extracted
    SEP: logic-higher-order
    View source passageHide passage
    Solovay has made a posting in FOM (2006 Other Internet Resources) in which he shows that the related statement that every complete second-order sentence \(\theta\) is categorical, is independent of ZFC. There is a strong form of categoricity which holds for Henkin structures in important cases and agrees with the usual concept of categoricity in the case of full Henkin models. It builds on the remarkable ability of second-order logic to express its own categoricity. The isomorphism \((M,R)\co

    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