A Note on Absolutely Unorderable Combinatory Algebras

Authors: Lusin S.1; Salibra A.1

Source: Journal of Logic and Computation, Volume 13, Number 4, August 2003 , pp. 481-502(22)

Publisher: Oxford University Press

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

Plotkin has conjectured that there exists an absolutely unorderable combinatory algebra, namely a combinatory algebra which cannot be embedded in another combinatory algebra admitting a nontrivial compatible partial order. In this paper we prove that a wide class of combinatory algebras admits extensions with a nontrivial compatible partial order.

Document Type: Original article

Affiliations: 1: Dipartimento di Informatica, Università Ca'Foscari di Venezia, Via Torino 155, 30172 Venezia, Italy. , salibra@dsi.unive.it

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$40.03 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A