Abstract
We prove a conjecture of Lauchli and Leonard that every sentence of the theory of linear order which has a model, has a model with a finitely axiomatized theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Ehrenfecht,Decidability of the theory of linear ordering relations, Notices Amer. Math. Soc.6 (1959), No. 3.
S. Feferman and A. L. Vaught,The first order properties of products of algebraic systems, Fund. Math.47 (1959), 57–103.
H. Lauchli and J. Leonard,On the elementary theory of linear order, Fund. Math.59 (1966), 109–116.
D. Myers,The Boolean algebra of the theory of linear order, Notices Amer. Math. Soc.21 (1974), T-E 82, Oct. 1974.
J. G. Rosenstein, ℵ0 categoricity of linear orderings, Fund. Math.64 (1969), 1–5.
M. Rubin,Theories of linear order, Israel J. Math.17 (1974), 392–443.
S. Shelah,The monadic theory of order, Ann. of Math.102 (1975), 379–419.
Author information
Authors and Affiliations
Additional information
The authors thank M. Rubin for his immense altruistic help. He discussed with Shelah the first proof, checked Amit’s thesis, detected many errors in the manuscript and has rewritten most of it (from Def. 2.4 on) with a much better presentation.
Rights and permissions
About this article
Cite this article
Amit, R., Shelah, S. The complete finitely axiomatized theories of order are dense. Israel J. Math. 23, 200–208 (1976). https://doi.org/10.1007/BF02761800
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02761800