completeness axiom
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 1)

H-INDEX

6
(FIVE YEARS 0)

2004 ◽  
Vol 115 (1) ◽  
pp. 118-133 ◽  
Author(s):  
Juan Dubra ◽  
Fabio Maccheroni ◽  
Efe A. Ok

2004 ◽  
Vol 2004 (69) ◽  
pp. 3799-3816
Author(s):  
S. K. Acharyya ◽  
K. C. Chattopadhyay ◽  
Partha Pratim Ghosh

The main aim of this paper is to provide a construction of the Banaschewski compactification of a zero-dimensional Hausdorff topological space as a structure space of a ring of ordered field-valued continuous functions on the space, and thereby exhibit the independence of the construction from any completeness axiom for an ordered field. In the process of describing this construction we have generalized the classical versions of M. H. Stone's theorem, the Banach-Stone theorem, and the Gelfand-Kolmogoroff theorem. The paper is concluded with a conjecture of a split in the class of all zero-dimensional but not strongly zero-dimensional Hausdorff topological spaces into three classes that are labeled by inequalities between three compactifications ofX, namely, the Stone-Čech compactificationβX, the Banaschewski compactificationβ0X, and the structure space𝔐X,Fof the lattice-ordered commutative ringℭ(X,F)of all continuous functions onXtaking values in the ordered fieldF, equipped with its order topology. Some open problems are also stated.


1997 ◽  
Vol 7 (5) ◽  
pp. 469-505 ◽  
Author(s):  
JOHN R. LONGLEY ◽  
ALEX K. SIMPSON

We propose a uniform way of isolating a subcategory of predomains within the category of modest sets determined by a partial combinatory algebra (PCA). Given a divergence on a PCA (which determines a notion of partiality), we identify a candidate category of predomains, the well-complete objects. We show that, whenever a single strong completeness axiom holds, the category satisfies appropriate closure properties. We consider a range of examples of PCAs with associated divergences and show that in each case the axiom does hold. These examples encompass models allowing a ‘parallel’ style of computation (for example, by interleaving), as well as models that seemingly allow only ‘sequential’ computation, such as those based on term-models for the lambda-calculus. Thus, our approach provides a uniform approach to domain theory across a wide class of realizability models. We compare our treatment with previous approaches to domain theory in realizability models. It appears that no other approach applies across such a wide range of models.


1991 ◽  
Vol 17 (1) ◽  
pp. 272
Author(s):  
Freiling ◽  
Humke

Sign in / Sign up

Export Citation Format

Share Document