About a 'concrete' Rauszer Boolean algebra generated by a preorder

05/19/2019
by   Luisa Iturrioz, et al.
0

Inspired by the fundamental results obtained by P. Halmos and A. Monteiro, concerning equivalence relations and monadic Boolean algebras, we recall the `concrete' Rauszer Boolean algebra pointed out by C. Rauszer (1971), via un preorder R. On this algebra we can consider one of the several binary operations defined, in an abstract way, by A. Monteiro (1971). The Heyting-Brouwer subalgebra of constants (fixpoints), allows us to give a general framework to find representations of several special algebraic structures related to logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2023

On Boolean reliability algebra

In this paper we consider systems which consist of binary components wit...
research
04/13/2020

Congruence Preservation, Lattices and Recognizability

Looking at some monoids and (semi)rings (natural numbers, integers and p...
research
04/30/2019

Overlap Algebras: a constructive look at complete Boolean algebras

The notion of a complete Boolean algebra, although completely legitimate...
research
01/26/2018

Neural Algebra of Classifiers

The world is fundamentally compositional, so it is natural to think of v...
research
08/17/2023

Proofs of valid categorical syllogisms in one diagrammatic and two symbolic axiomatic systems

Gottfried Leibniz embarked on a research program to prove all the Aristo...
research
02/17/2023

An Overview of Recent Developments in Big Boolean Equations

Methods of solving big Boolean equations can be broadly classified as al...
research
09/16/2023

Some Algebraic Aspects of Assume-Guarantee Reasoning

We present the algebra of assume-guarantee (AG) contracts. We define con...

Please sign up or login with your details

Forgot password? Click here to reset