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
    PA^F contains ¬F(τ) where τ is a fixed primitive recursiv... — Carmelics
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Even though PA^F is inconsistent due to the conditional sorites argument, any proof of a contradiction in PA^F requires infeasibly many steps for appropriate choices of τ.

    PA^F contains ¬F(τ) where τ is a fixed primitive recursive term denoting an infeasible number.

    Modality & PossibilityTruth & 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

    Modality & PossibilityTruth & Knowledge

    Connections

    1 topic

    Skepticism2 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.
    A proof of that length cannot be carried out in practice.Even though PA^F is inconsistent due to the conditional sorites argument, any pr...For τ = 2↑2^k (the super-exponential function iterated), any proof of contradict...

    Similar

    τ denotes an infeasible number such that ¬F(τ) must be accepted (S2).82%From (S2), some expression τ such as 10^12 does not denote a feasible ...77%PA^F contains the axioms of PA (restricted induction) and the statemen...76%F(0) holds, because 0 is the initial feasible number (S1).73%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    This view is most prominently associated with Yessenin-Volpin (1961; 1970), who is in turn best known for questioning whether expressions such as \(10^{12}\) or \(2^{50}\) denote natural numbers. e. numbers up to which we may count in practice. On this basis, he outlined a foundational program wherein feasibility is treated as a basic notion and traditional arguments in favor of the validity of mathematical induction and the uniqueness of the natural number series are called into question. [48]

    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