Step by step-building representations in algebraic logic
Journal of Symbolic Logic 62 (1):225-279 (1997)
| Abstract | We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterized according to the outcome of certain games. The Lyndon conditions defining representable relation algebras (for the finite case) and a similar schema for cylindric algebras are derived. Finite relation algebras with homogeneous representations are characterized by first order formulas. Equivalence games are defined, and are used to establish whether an algebra is ω-categorical. We have a simple proof that the perfect extension of a representable relation algebra is completely representable. An important open problem from algebraic logic is addressed by devising another two-player game, and using it to derive equational axiomatisations for the classes of all representable relation algebras and representable cylindric algebras. Other instances of this approach are looked at, and include the step by step method | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesTarek Sayed Ahmed (2008). On Complete Representations of Reducts of Polyadic Algebras. Studia Logica 89 (3):325 - 332.
Gábor Sági (2002). A Note on Algebras of Substitutions. Studia Logica 72 (2):265-284.
H. Andréka, I. Hodkinson & I. Németi (1999). Finite Algebras of Relations Are Representable on Finite Sets. Journal of Symbolic Logic 64 (1):243-267.
Tarek Sayed Ahmed (2002). Martin's Axiom, Omitting Types, and Complete Representations in Algebraic Logic. Studia Logica 72 (2):285 - 309.
Tarek Sayed Ahmed (2005). Algebraic Logic, Where Does It Stand Today? Bulletin of Symbolic Logic 11 (4):465-516.
Gábor Sági (2000). A Completeness Theorem for Higher Order Logics. Journal of Symbolic Logic 65 (2):857-884.
István Németi & Gábor Sági (2000). On the Equational Theory of Representable Polyadic Equality Algebras. Journal of Symbolic Logic 65 (3):1143-1167.
Robin Hirsch, Ian Hodkinson & Roger D. Maddux (2002). Relation Algebra Reducts of Cylindric Algebras and an Application to Proof Theory. Journal of Symbolic Logic 67 (1):197-213.
Roger D. Maddux (1989). Nonfinite Axiomatizability Results for Cylindric and Relation Algebras. Journal of Symbolic Logic 54 (3):951-974.
Robin Hirsch & Ian Hodkinson (1997). Complete Representations in Algebraic Logic. Journal of Symbolic Logic 62 (3):816-847.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
