Effective λ-models versus recursively enumerable λ-theories (Q3643360): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q752683 / rank
Normal rank
 
Property / author
 
Property / author: Antonino Salibra / rank
Normal rank
 
Property / author
 
Property / author: Chantal Berline / rank
 
Normal rank
Property / author
 
Property / author: Antonino Salibra / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCF extended with real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type theories, normal forms, and \(D_{\infty}\)-lambda-models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of basic functionality theory for \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph lambda theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-incompleteness and finite lambda reduction models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological incompleteness and order incompleteness of the lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-theoretical and other elementary models of the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lattice of Lambda Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easiness in graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda Theories of Effective Lambda Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph models of $\lambda$-calculus at work, and variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of stable models of untyped \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: βη-complete models for System <i>F</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism and equational equivalence of continuous \(\lambda\)-models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on dl-domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively given domains and lambda-calculus models / rank
 
Normal rank

Latest revision as of 04:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Effective λ-models versus recursively enumerable λ-theories
scientific article

    Statements

    Effective λ-models versus recursively enumerable λ-theories (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2009
    0 references
    0 references
    \(\lambda\)-theories
    0 references
    models
    0 references
    recursive enumerablility
    0 references
    \(\lambda \)-models
    0 references
    effective models
    0 references
    0 references
    0 references