Provability with Finitely Many Variables

DOI10.2307/3062204zbMath1024.03010OpenAlexW4205832820MaRDI QIDQ4779634

Roger D. Maddux, I. M. Hodkinson, Robin Hirschl

Publication date: 19 November 2003

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0803-toc.htm

zbMATH Keywords

provabilityprooffirst-order logic with equality

Mathematics Subject Classification ID

Classical first-order logic (03B10) Complexity of proofs (03F20)

Related Items

THE NEAT EMBEDDING PROBLEM FOR ALGEBRAS OTHER THAN CYLINDRIC ALGEBRAS AND FOR INFINITE DIMENSIONS ⋮ The calculus of relations as a foundation for mathematics ⋮ Neat embeddings, omitting types, and interpolation: an overview ⋮ Algebraic Logic, Where Does it Stand Today? ⋮ On conservative extensions in logics with infinitary predicates ⋮ Epimorphisms in cylindric algebras and definability in finite variable logic