A sufficient condition for completability of partial combinatory algebras

DOI10.2307/2275638zbMATH Open0918.03007OpenAlexW2046611773MaRDI QIDQ4382471FDOQ4382471

Authors: Andrea Asperti, Agata Ciabattoni 

Publication date: 17 August 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275638

Recommendations

• Extending partial combinatory algebras
• On the existence of extensional partial combinatory algebras
• Computability in partial combinatory algebras
• Collapsing partial combinatory algebras

zbMATH Keywords

completabilitycompletenesspartial combinatory algebra

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (8)

• On the existence of extensional partial combinatory algebras
• Effective applicative structures
• Algebraic properties implying weak sequential completeness
• Title not available (Why is that?)
• The complexity of completions in partial combinatory algebra
• Extensions of Scott's graph model and Kleene's second algebra
• Computability in partial combinatory algebras
• Embeddings between partial combinatory algebras

This page was built for publication: A sufficient condition for completability of partial combinatory algebras

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