Weakly representable atom structures that are not strongly representable, with an application to first order logic

Mathematical Logic Quarterly 54 (3):294-306 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Weakly representable atom structures that are not strongly representable, with an application to first order logic.Tarek Sayed Ahmed - 2008 - Mathematical Logic Quarterly 54 (3):294-306.
Strongly representable atom structures of cylindric algebras.Robin Hirsch & Ian Hodkinson - 2009 - Journal of Symbolic Logic 74 (3):811-828.
First-Order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier Depth.Rob Egrot & Robin Hirsch - 2022 - Journal of Symbolic Logic 87 (3):1283-1300.
On nonrepresentable G-polyadic algebras with representable cylindric reducts.Gábor Sági - 2011 - Logic Journal of the IGPL 19 (1):105-109.
There is no finite-variable equational axiomatization of representable relation algebras over weakly representable relation algebras.Jeremy F. Alm, Robin Hirsch & Roger D. Maddux - 2016 - Review of Symbolic Logic 9 (3):511-521.
A simple construction of representable relation algebras with non‐representable completions.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (3):237-244.
Atom structures of cylindric algebras and relation algebras.Ian Hodkinson - 1997 - Annals of Pure and Applied Logic 89 (2):117-148.
On the Languages Representable by Finite Probabilistic Automata.Phan Dinh Diêu - 1971 - Mathematical Logic Quarterly 17 (1):427-442.
A simple construction of representable relation algebras with non-representable completions.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (3):237-244.
On the Languages Representable by Finite Probabilistic Automata.Phan Dinh Diêu - 1971 - Mathematical Logic Quarterly 17 (1):427-442.

Analytics

Added to PP
2013-12-09

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references