Pa-Beweisbare ∀∃-Formeln (Q3338236): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>n</i>-quantifier induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schlussweisen-Kalküle der Prädikatenlogik / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functionals defined by transfinite recursion / rank
 
Normal rank

Latest revision as of 13:56, 14 June 2024

scientific article
Language Label Description Also known as
English
Pa-Beweisbare ∀∃-Formeln
scientific article

    Statements

    Pa-Beweisbare ∀∃-Formeln (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    proof theory
    0 references
    provable functions
    0 references
    arithmetical function hierarchy
    0 references
    subsystems of first order Peano Arithmetic
    0 references