Complexity of Gödel’s T in λ-Formulation (Q3637208): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Analyzing Gödel's T Via Expanded Head Reduction Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach to Fundamental Sequences and Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>n</i>-quantifier induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study / rank
 
Normal rank

Latest revision as of 18:59, 1 July 2024

scientific article
Language Label Description Also known as
English
Complexity of Gödel’s T in λ-Formulation
scientific article

    Statements

    Complexity of Gödel’s T in λ-Formulation (English)
    0 references
    0 references
    0 references
    7 July 2009
    0 references
    0 references
    typed \(\lambda \)-calculus
    0 references
    rewrite system
    0 references
    Gödel's T
    0 references
    strong normalization
    0 references
    termination
    0 references
    0 references