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
    The claim therefore conflates the well-behaved finitary f... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Strong completeness holds for many-sorted logic: if Γ ⊨ φ then Γ ⊢ φ

    The claim therefore conflates the well-behaved finitary fragment of many-sorted logic with richer formulations where incompleteness results analogous to those established by Lindström and later Barwise genuinely apply.

    ?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

    Barwise(a scholar referenced for work on extended logical systems)
    Jon Barwise was a logician who studied how formal logical systems work and their limitations, particularly in areas beyond traditional first-order logic.
    Finitary(as used in mathematical logic)
    Relating to logical systems that work with a finite number of steps or operations; basically, things you can actually finish proving in a reasonable amount of time.
    Formulations(as used in mathematical logic)
    Different ways of expressing or setting up a logical system or mathematical framework.
    Incompleteness results(as used in mathematical logic)
    Mathematical theorems proving that in any logical system complex enough to describe math, there will always be true statements that the system cannot prove to be true.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Lindström(as a historical reference)
    Per Lindström was a Swedish logician who proved important theorems about the limits and powers of different logical systems.
    many-sorted logic(Logic foundations and translations)
    A logic that accommodates reasoning about more than one sort (type) of objects, generalizing first-order logic by allowing multiple base types.

    Connections

    2 topics

    Proof of definition segments1 linkedPhilosophy of Language1 linked

    Related

    Strong completeness holds for many-sorted logic: if Γ ⊨ φ then Γ ⊢ φ

    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