Categorical Representations of Continuous Domains and Continuous L-Domains Based on Closure Spaces

09/13/2018
by   Longchun Wang, et al.
0

Closure space has proven to be a useful tool to restructure lattices and various order structures.This paper aims to provide a novel approach to characterizing some important kinds of continuous domains by means of closure spaces. By introducing an additional map into a given closure space, the notion of F-augmented generalized closure space is presented. It is shown that F-augmented generalized closure spaces generate exactly continuous domains. Moreover, the notion of approximable mapping is identified to represent Scott-continuous functions between continuous domains. These results produce a category equivalent to that of continuous domains with Scottcontinuous functions. At the same time, two subclasses of F-augmented generalized closure spaces are considered which are representations of continuous L-domains and continuous bounded complete domains, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2019

Continuous Domains in Formal Concept Analysis

Formal Concept Analysis has proven to be an effective method of restruct...
research
05/14/2021

On Bisimilarities for Closure Spaces - Preliminary Version

Closure spaces are a generalisation of topological spaces obtained by re...
research
11/19/2022

Representations of Domains via CF-approximation Spaces

Representations of domains mean in a general way representing a domain a...
research
07/08/2020

Closure hyperdoctrines, with paths

Spatial logics are modal logics whose modalities are interpreted using t...
research
08/19/2020

On the Notion of a Generalized Mapping on Multiset Spaces

This work presents a generalized notion of multiset mapping thus resolvi...
research
06/14/2019

On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs

It was recently pointed out that certain SiO_2 layer structures and SiO_...
research
06/03/2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices

We investigate the complexity of computing the Zariski closure of a fini...

Please sign up or login with your details

Forgot password? Click here to reset