The Neat Embedding Problem and the Number of Variables Required in Proofs

DOI10.2307/2048497zbMath0717.03025OpenAlexW4256624314MaRDI QIDQ3204457

Roger D. Maddux

Publication date: 1991

Full work available at URL: https://doi.org/10.2307/2048497

zbMATH Keywords

relation algebrasneat embedding problem

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15) Complexity of proofs (03F20)

Related Items (3)

Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Algebraization of quantifier logics, an introductory overview ⋮ Finite methods in 1-order formalisms

Cites Work

• Unnamed Item
• Cylindric algebras. Part I. With an introductory chapter: General theory of algebras. 2nd printing
• Some sufficient conditions for the representability of relation algebras
• Some Varieties Containing Relation Algebras
• 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

This page was built for publication: The Neat Embedding Problem and the Number of Variables Required in Proofs