Hodkinson, I

Venema, Y

Transactions of the American Mathematical Society

English

Abstract. We give a simple example of a variety V of modal algebras that is canonical but cannot be axiomatised by canonical equations or first-order sentences. We then show that the variety RRA of representable relation algebras, although canonical, has no canonical axiomatisation. Indeed, we show that every axiomatisation of these varieties involves infinitely many noncanonical sentences. Using probabilistic methods of Erdős, we construct an infinite sequence G0, G1,... of finite graphs with arbitrarily large chromatic number, such that each Gn is a bounded morphic image of Gn+1 and has no odd cycles of length at most n. The inverse limit of the sequence is a graph with no odd cycles, and hence is 2-colourable. It follows that a modal algebra (respectively, a relation algebra) obtained from the Gn satisfies arbitrarily many axioms from a certain axiomatisation of V (RRA), while its canonical extension satisfies only a bounded number of them. First-order compactness will now establish that V (RRA) has no canonical axiomatisation. A variant of this argument shows that all axiomatisations of these classes have infinitely many non-canonical sentences. 1

Ian Hodkinson

Yde Venema

CiteSeerX

Canonical varieties with no canonical axiomatisation

Hodkinson, I.

Venema, Y.

International Migration, Integration and Social Cohesion online publications

Search4Dev

Spiral - Imperial College Digital Repository

A sequent calculus for relation algebras,

An undecidable problem in correspondence theory,

Atom structures and Sahlqvist equations,

Atom structures of cylindric algebras and relation algebras,

Atomless varieties,

Boolean algebras with operators I,

Canonical pseudo-correspondence,

Combinatorial relations and chromatic graphs,

Contributions to the theory of models,

Discriminator varieties of boolean algebras with residuated operators,

Every world can see a reﬂexive world,

Graph theory, Graduate Texts

Inﬁnite games with perfect information, Contributions to the theory of games II,

Introductory course on relation algebras, ﬁnite-dimensional cylindric algebras, and their interconnections,

logic, Oxford Logic Guides,

Metamathematics of modal logic,

Modal Logic, Cambridge Tracts in

Normal modal logics can simulate all others,

On representable relation algebras,

On the calculus of relations,

On the structure of abstract algebras,

onsson, Representation of modular lattices and of relation algebras,

os, Graph theory and probability,

Relation algebras and projective geometries,

Relation algebras by games,

representable atom structures of relation algebras,

Simulating polyadic modal logics by monadic ones,

Step by step — building representations in algebraic logic,

The representation of relation algebras,

The representation of relational algebras,

The theory of binary relations,

The theory of representations for boolean algebras,

Tools and Techniques in Modal Logic,

Undecidability of the completeness problem of modal logic, Universal algebra and applications,

Undecidability of the disjunction property of propositional logics and other related problems,

Varieties of complex algebras,

NARCIS 

Abstract. We give a simple example of a variety V of modal algebras that is canonical but cannot be axiomatised by canonical equations or first-order sentences. We then show that the variety RRA of representable relation algebras, although canonical, has no canonical axiomatisation. Indeed, we show that every axiomatisation of these varieties involves infinitely many noncanonical sentences. Using probabilistic methods of Erdős, we construct an infinite sequence G0, G1,... of finite graphs with arbitrarily large chromatic number, such that each Gn is a bounded morphic image of Gn+1 and has no odd cycles of length at most n. The inverse limit of the sequence is a graph with no odd cycles, and hence is 2-colourable. It follows that a modal algebra (respectively, a relation algebra) obtained from the Gn satisfies arbitrarily many axioms from a certain axiomatisation of V (RRA), while its canonical extension satisfies only a bounded number of them. First-order compactness will now establish that V (RRA) has no canonical axiomatisation. A variant of this argument shows that all axiomatisations of these classes have infinitely many non-canonical sentences

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.6402

Canonical varieties with no canonical axiomatisation

Abstract

Similar works

Full text

Available Versions

CiteSeerX

International Migration, Integration and Social Cohesion online publications

International Migration, Integration and Social Cohesion online publications

International Migration, Integration and Social Cohesion online publications

Search4Dev

Spiral - Imperial College Digital Repository

NARCIS

CiteSeerX