Epimorphisms in cylindric algebras and definability in finite variable logic

DOI10.1007/s00012-009-0022-2zbMath1184.03060OpenAlexW2092043065MaRDI QIDQ1047108

Hajnalka Andréka, Judit X. Madarász, Stephen D. Comer, Tarek Sayed Ahmed, Istvan Németi

Publication date: 4 January 2010

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-009-0022-2

zbMATH Keywords

relation algebrasalgebraic logicalgebraizable logicscylindric algebrasfinite model theoryamalgamation propertypolyadic algebrasBeth definabilityfinite variable logicssurjectivity of epimorphisms

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Epimorphisms, monomorphisms, special classes of morphisms, null morphisms (18A20) Cylindric and polyadic algebras; relation algebras (03G15) Interpolation, preservation, definability (03C40) Subsystems of classical logic (including intuitionistic logic) (03B20) Abstract algebraic logic (03G27)

Related Items (11)

On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Finite-Variable Logics Do Not Have Weak Beth Definability Property ⋮ DISTANCES BETWEEN FORMAL THEORIES ⋮ How many varieties of cylindric algebras are there ⋮ New perspectives in algebraic logic, from neat embeddings to Erdős graphs ⋮ TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY ⋮ Neat embeddings, omitting types, and interpolation: an overview ⋮ Some results about neat reducts ⋮ The polyadic generalization of the Boolean axiomatization of fields of sets ⋮ Epimorphisms in cylindric algebras and definability in finite variable logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-variable property is stronger than H-dimension \(k\)
• Amalgamation, interpolation and epimorphisms in algebraic logic
• Epimorphisms in cylindric algebras and definability in finite variable logic
• On the chromatic number of certain highly symmetric graphs
• Cylindric algebras. Part II
• Isomorphic but not lower base-isomorphic cylindric algebras of finite dimension
• Interpolation and amalgamation; pushing the limits. II
• Isomorphisms of finite cylindric set algebras of characteristic zero
• How to define a linear order on finite models
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• Algebraic characterizations of various Beth definability properties
• Interpolation and amalgamation; pushing the limits. I
• Interpolation and definability in guarded fragments
• Martin's axiom, omitting types, and complete representations in algebraic logic
• Amalgamation in finite dimensional cylindric algebras
• Finitary polyadic algebras from cylindric algebras
• Freedom in polyadic algebras and two theorems of Beth and Craig
• Classes without the amalgamation property
• Amalgamation, congruence-extension, and interpolation properties in algebras
• On amalgamation of reducts of polyadic algebras
• Galois Theory for Cylindric Algebras and its Applications
• Amalgamation in relation algebras
• Interpolation in Algebraizable Logics Semantics for Non-Normal Multi-Modal Logic
• Saturatedness in cylindric algebraic model theory
• A completeness theorem for higher order logics
• On the search for a finitizable algebraization of first order logic
• On the number of generators of cylindric algebras
• Cylindric-relativised set algebras have strong amalgamation
• Provability with Finitely Many Variables
• Omitting types for finite variable fragments and complete representations of algebras
• On Cylindric Algebras Satisfying Merry-go-round Properties
• Amalgamation of Polyadic Algebras
• Relativized relation algebras
• Failure of interpolation in combined modal logics

This page was built for publication: Epimorphisms in cylindric algebras and definability in finite variable logic