Boolean-like algebras of finite dimension

06/18/2018
by   Antonio Bucciarelli, et al.
0

We introduce Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the so-called n-central elements. Varieties of nBAs share many remarkable properties with the variety of Boolean algebras and with primal varieties. Exploiting the concept of central element, we extend the notion of Boolean power to that of semiring power and we prove two representation theorems: (i) Any pure nBA is isomorphic to the algebra of n-central elements of a Boolean vector space; (ii) Any member of a variety of nBAs with one generator is isomorphic to a Boolean power of this generator. This gives a new proof of Foster's theorem on primal varieties. The nBAs provide the algebraic framework for generalising the classical propositional calculus to the case of n - perfectly symmetric - truth-values. Every finite-valued tabular logic can be embedded into such an n-valued propositional logic, nCL, and this embedding preserves validity. We define a confluent and terminating first-order rewriting system for deciding validity in nCL, and, via the embeddings, in all the finite tabular logics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/01/2022

Sequent calculi of finite dimension

In recent work, the authors introduced the notion of n-dimensional Boole...
research
04/23/2019

A formalization of forcing and the unprovability of the continuum hypothesis

We describe a formalization of forcing using Boolean-valued models in th...
research
10/16/2019

Algebraic Semantics for Propositional Awareness Logics

This paper puts forth a class of algebraic structures, relativized Boole...
research
12/12/2021

Interpreting Lambda Calculus in Domain-Valued Random Variables

We develop Boolean-valued domain theory and show how the lambda-calculus...
research
05/22/2019

Condition/Decision Duality and the Internal Logic of Extensive Restriction Categories

In flowchart languages, predicates play an interesting double role. In t...
research
02/10/2021

An unexpected Boolean connective

We consider a 2-valued non-deterministic connective ∧-5.5pt ∨ defined by...
research
04/30/2019

Overlap Algebras: a constructive look at complete Boolean algebras

The notion of a complete Boolean algebra, although completely legitimate...

Please sign up or login with your details

Forgot password? Click here to reset