Please note, due to scheduled maintenance online transactions will not be possible between 07:00 - 10:00 GMT, on Thursday 21st March (03:00-06:00 EDT, 21 March, 2019). We apologise for any inconvenience.
We give a negative answer to the question of whether every partial combinatory algebra can be completed. The explicit counterexample will be an intricately constructed term model. The construction and the proof that it works depend heavily on syntactic techniques. In particular, it provides a nice example of reasoning with elementary diagrams and descendants. We also include a domain-theoretic proof of the existence of an incompletable partial combinatory algebra.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.