An algebraic study of well-foundedness

algebraic semantics Boolean algebra complex algebras decidable equational theory diagonalisable algebra foundational algebra hemimorphism modal algebra modal logic quasi-variety wellfounded binary relations

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Equational classes, universal algebra in model theory (03C05) Logical aspects of Boolean algebras (03G05)

Review text

A foundational algebra (\({\mathfrak B},f,\lambda)\) consists of a hemimorphism f on a Boolean algebra \({\mathfrak B}\) with a greatest solution \(\lambda\) to the condition \(x\leq f(x)\). The quasi-variety of foundational algebras has a decidable equational theory, and generates the same variety as the complex algebras of structures (X,R), where f is given by R-images and \(\lambda\) is the non-wellfounded part of binary relation R. The corresponding results hold for algebras satisfying \(\lambda =0\), with respect to complex algebras of wellfounded binary relations. These algebras, however, generate the variety of all (\({\mathfrak B},f)\) with f a hemimorphism on \({\mathfrak B}.\) Admitting a second hemimorphism corresponding to the transitive closure of R allows foundational algebras to be equationally defined, in a way that gives a refined analysis of the notion of diagonalisable algebra.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: An algebraic study of well-foundedness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087540)