Pages that link to "Item:Q3874171"

The following pages link to The equational theory of <i>CA</i>₃ is undecidable (Q3874171):

Displayed 14 items.

• Relational lattices: from databases to universal algebra (Q299191) ‎ (← links)
• The relational model of data and cylindric algebras (Q761801) ‎ (← links)
• Augmenting ATL with strategy contexts (Q897650) ‎ (← links)
• On varieties of cylindric algebras with applications to logic (Q1098852) ‎ (← links)
• A class of decidable information logics (Q1128479) ‎ (← links)
• Embeddability into relational lattices is undecidable (Q1647970) ‎ (← links)
• Relation algebras can tile (Q1961863) ‎ (← links)
• Non-primitive recursive decidability of products of modal logics with expanding domains (Q2503403) ‎ (← links)
• On Satisfiability in ATL with Strategy Contexts (Q2915087) ‎ (← links)
• Pair-Dense Relation Algebras (Q3985845) ‎ (← links)
• Undecidability of Algebras of Binary Relations (Q5015973) ‎ (← links)
• (Q5016799) ‎ (← links)
• Embeddability into Relational Lattices Is Undecidable (Q5283216) ‎ (← links)
• Algebraic Logic, Where Does it Stand Today? (Q5472642) ‎ (← links)