Restricted completeness of extended Boolean algebras (Q1288094)

Let be \(n\in\omega\) or \(n=\omega\). A model \(M\) is called \(n\)-complete provided that, on \(M\), each finitary formula with \(\leq n\) alternations of quantifiers is a union of \(\exists\)-formulas. The definitions of ultimate \(n\)-completeness use enrichments by constants. These definitions were introduced by \textit{R. Cusin} [Fundam. Math. 84, 265-270 (1974; Zbl 0287.02035)] and \textit{S. S. Goncharov} [Sib. Math. J. 34, No. 5, 812-824 (1993; Zbl 0860.03032), Algebra Logic 32, No. 6, 342-360 (1993; Zbl 0824.03013)]. The author constructs an \(n\)-complete Boolean algebra in an extended language for all reasonable values of \(n\in\omega\cap\{\omega\}\). Then the author studies restricted completeness for Boolean algebras with distinguished ideals.