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
    Many-sorted logic also possesses these properties (Compac... — Carmelics
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Many-sorted logic cannot be considered a proper (strict) extension of first-order logic

    Many-sorted logic also possesses these properties (Compactness and Löwenheim-Skolem) as corollaries of its completeness theorem

    Philosophy of LanguageProof of definition segments
    ?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 LanguageProof of definition segments

    Connections

    1 topic

    Truth & Knowledge2 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.
    First-order logic is the strongest logic where Löwenheim-Skolem holds and its se...Lindström (1969) proves that first-order logic is the strongest logic possessing...Many-sorted logic cannot be considered a proper (strict) extension of first-orde...

    Similar

    Many-sorted logic also possesses the Compactness and Löwenheim-Skolem ...93%Strong completeness (if Γ ⊨ φ then Γ ⊢ φ) holds for many-sorted logic.88%Strong completeness holds for many-sorted logic: if Γ ⊨ φ then Γ ⊢ φ87%The proof rests on the completeness theorem for one-sorted first-order...86%

    Source

    AI-extracted
    SEP: logic-many-sorted
    View source passageHide passage
    , determining validity, or equivalently, testing for satisfiability of given formulas) for many-sorted logic is undecidable. So, we are in the same situation encountered in one-sorted first-order logic. Of course, if a calculus is to be helpful it would never allow erroneous reasonings: it is not going to drive us from true hypotheses to false conclusions. It must be a sound calculus. Further, it is highly desirable that all the consequences of a set \(\Gamma\) of hypotheses could be derived fr

    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