Finite algebras of relations are representable on finite sets

DOI10.2307/2586762zbMath0926.03078OpenAlexW1992702120MaRDI QIDQ4254632

Istvan Németi, Hajnalka Andréka, I. M. Hodkinson

Publication date: 29 November 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/15d79c1699180fa4f4519ac085e1974155ec3faa

zbMATH Keywords

finite algebrafinite base propertyweakly associative relation algebrasdecidable universal theoriesrelativized cylindric set algebras

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (11)

Undecidable relativizations of algebras of relations ⋮ On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality ⋮ A brief history of Tarskian algebraic logic with new perspectives and innovations ⋮ Relation algebras from cylindric algebras. I ⋮ On the Restraining Power of Guards ⋮ First order logic without equality on relativized semantics ⋮ Weakly associative relation algebras with projections ⋮ Extending partial isomorphisms for the small index property of many \(\omega\)-categorical structures ⋮ Atoms in infinite dimensional free sequence-set algebras ⋮ Guards, bounds, and generalized semantics ⋮ The semijoin algebra and the guarded fragment

Cites Work

• Extending partial isomorphisms of graphs
• Modal languages and bounded fragments of predicate logic
• Extending partial isomorphisms on finite structures
• Relativised quantification: Some canonical varieties of sequence-set algebras
• Decidability of cylindric set algebras of dimension two and first-order logic with two variables
• Boolean Algebras with Operators. Part I

This page was built for publication: Finite algebras of relations are representable on finite sets