Sharp Elements and the Scott Topology of Continuous Dcpos

Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness and a notion of sharp elements. Being apart is a positive formulation of being unequal, similar to how inhabitedness is a positive formulation of nonemptiness. To exemplify sharpness, we note that a lower real is sharp if and only if it is located. Our first main result is that for a large class of continuous dcpos, the Bridges-Viţǎ apartness topology and the Scott topology coincide. Although we cannot expect a tight or cotransitive apartness on nontrivial dcpos, we prove that the intrinsic apartness is both tight and cotransitive when restricted to the sharp elements of a continuous dcpo. These include the strongly maximal elements, as studied by Smyth and Heckmann. We develop the theory of strongly maximal elements highlighting its connection to sharpness and the Lawson topology. Finally, we illustrate the intrinsic apartness, sharpness and strong maximality by considering several natural examples of continuous dcpos: the Cantor and Baire domains, the partial Dedekind reals, the lower reals and finally, an embedding of Cantor space into an exponential of lifted sets.

[1]  Dirk Pattinson,et al.  Constructive Domains with Classical Witnesses , 2019, Log. Methods Comput. Sci..

[2]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[3]  P. Martin-Löf Notes on constructive mathematics , 1970 .

[4]  Tom de Jong,et al.  Predicative Aspects of Order Theory in Univalent Foundations , 2021, FSCD.

[5]  Peter T. Johnstone,et al.  Open locales and exponentiation , 1984 .

[6]  J. L. Bell CONSTRUCTIVE ANALYSIS (Grundlehren der mathematischen Wissenschaften, 279) , 1986 .

[7]  Michael B. Smyth,et al.  The constructive maximal point space and partial metrizability , 2006, Ann. Pure Appl. Log..

[8]  Tatsuji Kawai Predicative theories of continuous lattices , 2021, Log. Methods Comput. Sci..

[9]  Sara Negri,et al.  Continous Lattices in Formal Topology , 1996, TYPES.

[10]  Silvio Valentini,et al.  Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology , 1996, Theor. Comput. Sci..

[11]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[12]  Wim Ruitenburg,et al.  A Course in Constructive Algebra , 1987 .

[13]  Andrej Bauer,et al.  A constructive theory of continuous domains suitable for implementation , 2009, Ann. Pure Appl. Log..

[14]  Tatsuji Kawai,et al.  Geometric theories of patch and Lawson topologies , 2017, ArXiv.

[15]  Dana S. Scott,et al.  A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..

[16]  Sara Negri,et al.  Continuous domains as formal spaces , 2002, Mathematical Structures in Computer Science.

[17]  Thierry Coquand,et al.  Inductively generated formal topologies , 2003, Ann. Pure Appl. Log..

[18]  Marcelo P Fiore,et al.  Topology via Logic , 1999 .

[19]  Tom de Jong,et al.  Domain Theory in Constructive and Predicative Univalent Foundations , 2020, CSL.

[20]  Nick Benton,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[21]  A. Troelstra,et al.  Constructivism in Mathematics: An Introduction , 1988 .

[22]  Martín Hötzel Escardó,et al.  Exhaustible Sets in Higher-type Computation , 2008, Log. Methods Comput. Sci..

[23]  Dag Normann,et al.  Higher-Order Computability , 2015, Theory and Applications of Computability.

[24]  Michael Hedberg,et al.  A type-theoretic interpretation of constructive domain theory , 1996, Journal of Automated Reasoning.

[25]  Jimmie D. Lawson,et al.  Spaces of maximal points , 1997, Mathematical Structures in Computer Science.

[26]  Robert Dockins,et al.  Formalized, Effective Domain Theory in Coq , 2014, ITP.

[27]  F. Richman,et al.  Varieties of Constructive Mathematics: CONSTRUCTIVE ALGEBRA , 1987 .

[28]  Douglas S. Bridges,et al.  Apartness and Uniformity - A Constructive Development , 2011, Theory and Applications of Computability.

[29]  Samson Abramsky,et al.  Domain Theory and the Logic of Observable Properties , 2011, ArXiv.

[30]  G. Sambin Intuitionistic Formal Spaces — A First Communication , 1987 .

[31]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[32]  Silvio Valentini,et al.  Exponentiation of Scott Formal Topologies , 2004, Electron. Notes Theor. Comput. Sci..

[33]  Bas Spitters Locatedness and overt sublocales , 2010, Ann. Pure Appl. Log..