Admissible closures of polynomial time computable arithmetic (Q634777)

From MaRDI portal
Revision as of 10:10, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Admissible closures of polynomial time computable arithmetic
scientific article

    Statements

    Admissible closures of polynomial time computable arithmetic (English)
    0 references
    0 references
    0 references
    16 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial-time computable arithmetic
    0 references
    Kripke-Platek set theory
    0 references
    second-order arithmetic
    0 references
    0 references