Provability with Finitely Many Variables

DOI10.2307/2036319zbMath0216.01004OpenAlexW4235696876MaRDI QIDQ5619082

J. Donald Monk

Publication date: 1971

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

Mathematics Subject Classification ID

Algebraic logic (03G99) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (6)

On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras ⋮ On varieties of cylindric algebras with applications to logic ⋮ Algebraization of quantifier logics, an introductory overview ⋮ The Neat Embedding Problem and the Number of Variables Required in Proofs ⋮ The relational model of data and cylindric algebras ⋮ On conservative extensions in logics with infinitary predicates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cylindric algebras. Part II
• Undecidability of the homogeneous formulas of degree 3 of the predicate calculus
• On Tarski's formalization of predicate logic with identity
• Nonfinitizability of classes of representable cylindric algebras
• Nonfinitizability of classes of representable polyadic algebras

This page was built for publication: Provability with Finitely Many Variables