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
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
Links for this article