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 the axioms of PA (restricted induction) and... — Carmelics
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→PA^F is inconsistent.

    PA^F contains the axioms of PA (restricted induction) and the statement not-F(tau) for an infeasible number tau.

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

    Modality & PossibilityProof of definition segments

    Related

    PA^F is inconsistent.The conditional form of the sorites argument derives F(tau) by repeated modus po...The inductive form of the sorites argument is blocked in PA^F, but the condition...

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.

    Similar

    PA^F restricts the induction schema to formulas not containing F(x).77%PA^F contains ¬F(τ) where τ is a fixed primitive recursive term denoti...76%PDL includes the induction axiom (Axiom 5)75%From (S2), some expression τ such as 10^12 does not denote a feasible ...75%

    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