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 Π¹₁-formula θ axiomatizes structures that interpret s... — Carmelics
    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.

    The Π¹₁-formula θ axiomatizes structures that interpret second-order quantification over a base set U as first-order quantification over the power-set expansion of U.

    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 & Knowledge3 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.
    Any second-order sentence φ translates to a first-order sentence φ* relative to ...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...

    Similar

    In any model of θ, monadic second-order formulas over the base set U c...80%Every second-order formula is logically equivalent to a formula in Pre...79%Δ¹₁-formulas are those second-order formulas that are logically equiva...78%Any quantifier Q_ψ is defined by restricting second-order quantificati...77%

    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