Constructivizable models with a linear structure of algebraic reducibility (Q2641295)

Let \({\mathfrak A}\) be a model. The surjection \(\nu\) : \(\omega\to {\mathfrak A}\) is said to be a constructivization of \({\mathfrak A}\) if, given a quantifier- free formula \(\theta (x_ 1,...,x_ n)\) and natural numbers \(m_ 1,...,m_ n\), one can effectively decide whether \({\mathfrak A}\vDash \theta (m_ 1,...,m_ n)\). Constructivization \(\nu\) algebraically reduces to \(\mu\) (\(\nu\leq \mu)\) if any relation on \({\mathfrak A}\) that is stable with respect to automorphisms and recursive with respect to \(\mu\), is recursive with respect to \(\nu\). The relation \(\leq\) is a quasi-order. Factorizing it with respect to the equivalence relation ``\(\nu\leq \mu\) and \(\mu\leq \nu ''\), we get an algebraic reducibility structure L(\({\mathfrak A})\) that is an order. The author proves that for any \(n\geq 3\) there exists a model \({\mathfrak A}\) such that L(\({\mathfrak A})\) is an n-element linear order.