The Neat Embedding Problem and the Number of Variables Required in Proofs
From MaRDI portal
Recommendations
- Relation algebra reducts of cylindric algebras and an application to proof theory
- Provability with Finitely Many Variables
- Neat embeddings, omitting types, and interpolation: an overview
- Nonfinite axiomatizability results for cylindric and relation algebras
- The neat embedding problem for algebras other than cylindric algebras and for infinite dimensions
Cites work
- Cylindric algebras. Part I. With an introductory chapter: General theory of algebras. 2nd printing
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- Nonfinite axiomatizability results for cylindric and relation algebras
- Nonfinitizability of classes of representable cylindric algebras
- Nonfinitizability of classes of representable polyadic algebras
- Provability with Finitely Many Variables
- Some sufficient conditions for the representability of relation algebras
- Some Varieties Containing Relation Algebras
Cited in
(6)- Algebraization of quantifier logics, an introductory overview
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Relation algebra reducts of cylindric algebras and an application to proof theory
- Provability with Finitely Many Variables
- scientific article; zbMATH DE number 6287557 (Why is no real title available?)
- Finite methods in 1-order formalisms
This page was built for publication: The Neat Embedding Problem and the Number of Variables Required in Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204457)
