Step by step – Building representations in algebraic logic
From MaRDI portal
Publication:4338323
DOI10.2307/2275740zbMATH Open0879.03018OpenAlexW2112303653MaRDI QIDQ4338323FDOQ4338323
Publication date: 22 December 1997
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275740
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maintaining knowledge about temporal intervals
- Cylindric algebras. Part II
- Temporal constraint networks
- Boolean Algebras with Operators
- Algebraization of quantifier logics, an introductory overview
- On representable relation algebras
- Representations of integral relation algebras
- The representation of relational algebras
- The representation of relation algebras. II
- Axioms for tense logic. I: 'Since' and 'until'
- Completing theories by forcing
- Weakly representable but not representable relation algebras
- A nonpermutational integral relation algebra
- Preface for Studia Logica special issue (2)
Cited In (21)
- Rectangular games
- The finitely axiomatizable complete theories of non-associative arrow frames
- Geometrical representation theorems for cylindric-type algebras
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Algebraic Logic, Where Does it Stand Today?
- Tractable approximations for temporal constraint handling
- Relation algebras from cylindric algebras. I
- Atom structures of cylindric algebras and relation algebras
- On the representability of neatly embeddable CA's by cylindric relativized algebras
- Neat embeddings, omitting types, and interpolation: an overview
- Reducts of relation algebras: the aspects of axiomatisability and finite representability
- Relation algebras of intervals
- New perspectives in algebraic logic, from neat embeddings to Erdős graphs
- How many varieties of cylindric algebras are there
- Strongly representable atom structures of relation algebras
- Inequivalent representations of geometric relation algebras
- Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
- Representability is not decidable for finite relation algebras
- The polyadic generalization of the Boolean axiomatization of fields of sets
- Omitting types for algebraizable extensions of first order logic
- Canonical varieties with no canonical axiomatisation
This page was built for publication: Step by step – Building representations in algebraic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338323)
