<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>This Mizar paper presents the definition of a "Preordered Coherent Space" (PCS). Furthermore, the paper defines a number of operations on PCS's and states and proves a number of elementary lemmas about these operations. PCS's have many useful properties which could qualify them for mathematical study in their own right. PCS's were invented, however, to construct Scott domains, to solve domain equations, and to construct models of various versions of lambda calculus.</p><p>For more on PCS's, see [11]. The present Mizar paper defines the operations on PCS's used in Chapter 8 of [3].</p></abstract>

This Mizar paper presents the definition of a "Preordered Coherent Space" (PCS). Furthermore, the paper defines a number of operations on PCS's and states and proves a number of elementary lemmas about these operations. PCS's have many useful properties which could qualify them for mathematical study in their own right. PCS's were invented, however, to construct Scott domains, to solve domain equations, and to construct models of various versions of lambda calculus.For more on PCS's, see [11]. The present Mizar paper defines the operations on PCS's used in Chapter 8 of [3].

Basic Operations on Preordered Coherent Spaces

DIKU, University of Copenhagen, Universitetsparken 1 DK-2100 Copenhagen Denmark

Institute of Computer Science, University of Białystok, Sosnowa 64, 15-887 Białystok Poland

Formalized Mathematics

{"article-title":"Basic Operations on Preordered Coherent Spaces"}

This Mizar paper presents the definition of a "Preordered Coherent Space" (PCS). Furthermore, the paper defines a number of operations on PCS's and states and...

Basic Operations on Preordered Coherent Spaces

Published Online: Jun 09, 2008

Page range: 213 - 230

DOI: https://doi.org/10.2478/v10037-007-0025-4

This content is open access.