σ-locales and Booleanization in Formal Topology

01/29/2018
by   Francesco Ciraulo, et al.
0

A σ-frame is a poset with countable joins and finite meets in which binary meets distribute over countable joins. Aim of this paper is to present σ-frames, actually σ-locales, as a branch of Formal Topology, that is, intuitionistic and predicative pointfree topology. We show that every σ-frame L can be presented as the lattice of Lindelöf elements (those whose covers admit countable subcovers) of a formal topology of a specific kind which, in its turn, corresponds to the free frame over L. We then give a constructive characterization of the smallest dense σ-sublocale of a given σ-locale, thus providing a "σ-version" of a Boolean locale.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2017

Polishness of some topologies related to automata (Extended version)

We prove that the Büchi topology, the automatic topology, the alphabetic...
research
07/19/2022

Formalising the Krull Topology in Lean

The Galois group of an infinite Galois extension has a natural topology,...
research
09/11/2022

Information content in formal languages

Motivated by creating physical theories, formal languages S with variabl...
research
02/25/2022

Constructive subsampling of finite frames with applications in optimal function recovery

In this paper we present new constructive methods, random and determinis...
research
02/13/2018

The principle of point-free continuity

In the setting of constructive point-free topology, we introduce a notio...
research
08/02/2022

Interval-Dismantling for Lattices

Dismantling allows for the removal of elements of a set, or in our case ...
research
12/19/2021

Topology Preserving Local Road Network Estimation from Single Onboard Camera Image

Knowledge of the road network topology is crucial for autonomous plannin...

Please sign up or login with your details

Forgot password? Click here to reset