Local sentences were introduced by J.-P. Ressayre who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for these sentences and the existence of some infinite well ordered models. Two of these stretching theorems were only proved under certain large cardinal axioms but the question of their exact (consistency) strength was left open in [O. Finkel and J.-P. Ressayre, Stretchings, Journal of Symbolic Logic, Volume 61 ( 2), 1996, p. 563-585 ]. Here, we solve this problem, using a combinatorial result of J. H. Schmerl. In fact, we show that the stretching principles are equivalent to the existence of n-Mahlo cardinals for appropriate integers n. This is done by proving first that for each integer n, there is a local sentence phi_n which has well ordered models of order type alpha, for every infinite ordinal alpha > omega which is not an n-Mahlo cardinal.
[1]
Olivier Finkel.
On decidability properties of local sentences
,
2006,
Theor. Comput. Sci..
[2]
Dana,et al.
JSL volume 88 issue 4 Cover and Front matter
,
1983,
The Journal of Symbolic Logic.
[3]
James H. Schmerl.
A partition property characterizing cardinals hyperinaccessible of finite type
,
1974
.
[4]
Olivier Finkel.
Closure properties of locally finite omega-languages
,
2004,
Theor. Comput. Sci..
[5]
Jean-Pierre Ressayre.
Formal Languages Defined by the Underlying Structure of their Words
,
1988,
J. Symb. Log..
[6]
F. Stephan,et al.
Set theory
,
2018,
Mathematical Statistics with Applications in R.
[7]
Olivier Finkel.
Locally finite languages
,
2001,
Theor. Comput. Sci..