On the search for a finitizable algebraization of first order logic
From MaRDI portal
Publication:4511602
DOI10.1093/jigpal/8.4.497zbMath0973.03008OpenAlexW2030879865MaRDI QIDQ4511602
Publication date: 23 November 2001
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/025bd90666e81b22befc3e7aa6a2642ee64d522f
Classical first-order logic (03B10) Equational classes, universal algebra in model theory (03C05) Cylindric and polyadic algebras; relation algebras (03G15) Representation of semigroups; actions of semigroups on sets (20M30)
Related Items (10)
On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ How many varieties of cylindric algebras are there ⋮ Omitting types for finite variable fragments and complete representations of algebras ⋮ Complexity of equational theory of relational algebras with standard projection elements ⋮ A Completeness Result for Relation Algebra with Binders ⋮ Neat embeddings, omitting types, and interpolation: an overview ⋮ Omitting types for algebraizable extensions of first order logic ⋮ Epimorphisms in cylindric algebras and definability in finite variable logic ⋮ Varieties of Algebras without the Amalgamation Property
This page was built for publication: On the search for a finitizable algebraization of first order logic
