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
    'Likes' can be described as a predicate satisfied by orde... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→'Every' can be treated as a predicate satisfied by ordered pairs ⟨X, Y⟩ such that the extension of X includes the extension of Y.

    'Likes' can be described as a predicate satisfied by ordered pairs ⟨x, y⟩ such that x likes y.

    Philosophy of Language
    ?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 Language

    Related

    'Every' can be treated as a predicate satisfied by ordered pairs ⟨X, Y⟩ such tha...The same predicate-of-ordered-pairs treatment can be extended from relations bet...

    Similar

    'Every' can be treated as a predicate satisfied by ordered pairs ⟨X, Y...

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.
    90%
    Quantifiers can be represented as functions on ordered pairs of predic...82%
    Someone likes Juliet and Romeo likes someone (∃x[L(x,j)] ∧ ∃x[L(r,x)])...78%
    Being is a positive predicate76%

    Source

    AI-extracted
    SEP: logical-form
    View source passageHide passage
    Just as we can describe ‘likes’ as a predicate satisfied by ordered pairs \(\langle x, y \rangle\) such that \(x\) likes \(y\), so we can think about ‘every’ as a predicate satisfied by ordered pairs \(\langle X, Y \rangle\) such that the extension of \(X\) includes the extension of \(Y\). (This is compatible with thinking about ‘every boy’ as a restricted quantifier that combines with a predicate to form a sentence that is true iff every boy satisfies that predicate.) One virtue of this notatio

    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