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
    The definition of the least upper bound involves a quanti... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→The least upper bound of a bounded class S of real numbers whose members are of r-type τ must belong to r-type τ/1

    The definition of the least upper bound involves a quantifier ranging over the elements of S

    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

    Related

    In ramified type theory, quantification over elements of r-type τ produces an ex...The least upper bound of a bounded class S of real numbers whose members are of ...

    Similar

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.
    The least upper bound of the ordinal indices appearing in the finitist...75%Defining real numbers via Dedekindian classes requires that every clas...73%Vague quantifiers such as 'few', 'many', and 'almost all' convey proba...72%The least upper bound of a bounded class S of real numbers whose membe...72%

    Source

    AI-extracted
    SEP: principia-mathematica
    View source passageHide passage
    Given that the system of PM contains a ramified theory of types, however, the move to discussion of classes for the remainder of the work after ∗20 requires a further axiom, the axiom of reducibility, in order to allow a simple theory of types of classes. Consider the fundamental notion from the theory of real numbers of the least upper bound (l.u.b.) of a bounded class of real numbers. Consider the class of all real numbers whose square is less than or equal to 2, i.e., \(\{ x \mid x^2 \leq 2\}

    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