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
    Any second-order sentence φ translates to a first-order s... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Checking the validity of an arbitrary second-order sentence φ can be recursively reduced to checking the validity of a Σ¹₁-sentence.

    Any second-order sentence φ translates to a first-order sentence φ* relative to models of θ.

    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

    Proof of definition segments3 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.
    Checking the validity of an arbitrary second-order sentence φ can be recursively...The original sentence φ is valid if and only if the Σ¹₁-sentence (θ → φ*) is val...The Π¹₁-formula θ axiomatizes structures that interpret second-order quantificat...

    Similar

    The categoricity of a sentence θ(P) — that any two models of θ(P) are ...83%The property of a second-order sentence having a model is not absolute...82%The truth of the second-order sentence θ_CH in a sufficiently large mo...82%The property of a model satisfying a second-order sentence is not abso...81%

    Source

    AI-extracted
    SEP: logic-higher-order
    View source passageHide passage
    During round i of the game player I can pick a relation \(A_i\) on A (or an element \(a_i\) of A) and then player II has to pick a relation \(B_i\) on B of the same arity as \(A_i\) (or an element \(b_i\) of on B) and vice versa: Player I can instead pick a relation \(B_i\) on B (or an element \(b_i\) of B) and then II picks a relation \(A_i\) on A of the same arity as \(B_i\) (or an element \(a_i\)) of A. After n rounds the pairs of played elements \((a_i,b_i)\) form a binary relation R on \(A\

    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