Admissible closures of polynomial time computable arithmetic (Q634777): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conservation Result Concerning Bounded Theories and the Collection Axiom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric Interpretations for Bounded Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The provably terminating operations of the subsystem PETJ of explicit mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of extensionality. II: Weak weak set theories without infinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary explicit types and polynomial time operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realisability in weak systems of explicit mathematics / rank
 
Normal rank

Revision as of 09:10, 4 July 2024

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
    polynomial-time computable arithmetic
    0 references
    Kripke-Platek set theory
    0 references
    second-order arithmetic
    0 references

    Identifiers