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
    The LST-number of second-order logic is the Löwenheim–Sko... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→The LST-number of second-order logic exists if and only if there are supercompact cardinals greater than ω, and when it exists it equals the smallest such supercompact cardinal.

    The LST-number of second-order logic is the Löwenheim–Skolem–Tarski number, characterizing the downward model-size behavior of second-order logic.

    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

    Related

    Magidor (1971) proved that the existence condition and the identity of the LST-n...The LST-number of second-order logic exists if and only if there are supercompac...

    Similar

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.
    Second-order arithmetic Z_2 is a significant foundational success for ...82%The LST-number of second-order logic exists if and only if there are s...80%The Löwenheim number and Hanf number of full second-order logic equal ...79%The Compactness Theorem does not hold for second-order logic in the fo...78%

    Source

    AI-extracted
    SEP: logic-higher-order
    View source passageHide passage
    The only difference is that one has to start with a big model, a model of the size of a measurable cardinal. Smaller cardinals need not work. For example, if \(\lambda\) is the least weakly compact cardinal \(>\omega\), then there is a sentence \(\phi\) which has \(\lambda\) (with the empty vocabulary) as a model but no smaller models. The sentence[10] \(\phi\) says that \(\lambda\) is inaccessible (\(>\omega\)) and that every \(\lambda\)-tree (a tree of height \(\lambda\) with all level

    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