Predicative theories of continuous lattices

06/10/2020
by   Tatsuji Kawai, et al.
0

The paper introduces strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the coalgebras of the lower powerlocale on the wider category of proximity posets (known as abstract bases and R-structure). Moreover, locally compact locales can be characterised in terms of strong proximity join-semilattices by the coalgebras of the double powerlocale on the category of proximity posets. The paper also introduces more logical characterisation of a strong proximity join-semilattice, called a strong continuous finitary cover, which uses an entailment relation to present the underlying join-semilattice. It is shown that this structure naturally corresponds to the notion of continuous lattice in the predicative pointfree topology. The result makes the predicative and finitary aspect of the notion of continuous lattice in point-free topology more explicit.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2018

Presenting de Groot duality of stably compact spaces

We give a constructive account of the de Groot duality of stably compact...
research
11/04/2019

The involutive quantaloid of completely distributive lattices

Let L be a complete lattice and let Q(L) be the unital quantale of join-...
research
10/08/2019

Canonical extensions of locally compact frames

Canonical extension of finitary ordered structures such as lattices, pos...
research
07/18/2018

Mix -autonomous quantales and the continuous weak order

The set of permutations on a finite set can be given a lattice structure...
research
12/05/2018

The continuous weak order

The set of permutations on a finite set can be given the lattice structu...
research
12/09/2020

On the Lattice of Conceptual Measurements

We present a novel approach for data set scaling based on scale-measures...
research
06/05/2020

Verifying Strong Eventual Consistency in δ-CRDTs

Conflict-free replicated data types (CRDTs) are a natural structure with...

Please sign up or login with your details

Forgot password? Click here to reset