scientific article; zbMATH DE number 3648679

zbMATH Open0417.03006MaRDI QIDQ3206926FDOQ3206926

Authors:

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

consistencylambda calculusgraph model

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Relative consistency and interpretations (03F25)

Cited In (21)

• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Collapsing partial combinatory algebras
• A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
• On the construction of stable models of untyped \(\lambda\)-calculus
• Consistency argument and classification problem in \(\lambda\)-calculus
• Unfixing the fixpoint: the theories of the \(\lambda Y\)-calculus
• Graph easy sets of mute lambda terms
• Computability in higher types, P\(\omega\) and the completeness of type assignment
• Forcing in stable models of untyped \(\lambda\)-calculus
• Infinite \(\lambda\)-calculus and types
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Some new results on easy lambda-terms
• A \(\kappa\)-denotational semantics for map theory in ZFC+SI
• Finite type structures within combinatory algebras
• Easiness in graph models
• Simple easy terms
• Easy lambda-terms are not always simple
• Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result
• Intersection types and domain operators
• On the Jacopini technique

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206926)