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
    Strict finitism emphasizes the practical aspects of how n... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Strict finitism anticipates concerns that also motivated the development of computational complexity theory.

    Strict finitism emphasizes the practical aspects of how numerals are used to represent natural numbers in arithmetical computations.

    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

    Skepticism2 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.
    Complexity theory is similarly motivated by questions about what is feasibly or ...Strict finitism anticipates concerns that also motivated the development of comp...

    Similar

    Strict finitism emphasizes the practical aspects of how numerals repre...99%Strict finitists identify the natural numbers with those representable...79%Strict finitists hold that only numbers constructible by counting or e...77%Expressions such as 10^{12} or 2^{50} may not denote natural numbers u...76%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    Whereas a traditional bounded quantifier is of the form \(\forall x \lt t\) or \(\exists x \lt t\), a so-called sharply bounded quantifier is of the form \(\forall x \lt \lvert t\rvert\) or \(\exists x \lt \lvert t\rvert\) (for \(t\) an \(\mathcal{L}^b_a\)-term not involving \(x\)). e. by counting alternations of bounded quantifiers, ignoring sharply bounded ones. The theories \(\mathsf{S}^i_2\) and \(\mathsf{T}^i_2\) both extend a base theory known as \(\textsf{BASIC}\). , Hájek and Pudlák 1998

    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