Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

The neat embedding problem and the number of variables required in proofs


Author: Roger D. Maddux
Journal: Proc. Amer. Math. Soc. 112 (1991), 195-202
MSC: Primary 03G15; Secondary 03B10, 03F07
MathSciNet review: 1033959
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: By constructing special relation algebras we show that if $ 3 < \alpha < \omega $, then

$\displaystyle {\mathbf{S}}N{{\text{r}}_3}C{A_\alpha } \ne {\mathbf{S}}N{{\text{r}}_3}C{A_{3\alpha - 7}}$

and there is a logically valid first-order sentence containing at most three variables with a proof in which every sentence has at most $ 3\alpha - 7$ variables, but no proof in which every sentence has at most a variables.

References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03G15, 03B10, 03F07

Retrieve articles in all journals with MSC: 03G15, 03B10, 03F07


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1991-1033959-7
Article copyright: © Copyright 1991 American Mathematical Society