Effectively infinite classes of weak constructivizations of models
Weak constructivizations of strongly constructive models are studied. An enumerated model \((M, \nu)\), where \(\nu\) is an enumeration of \(M\), is called strongly constructive (constructive) if there exists an algorithm to recognize all (quantifier-free) formulas \(\varphi(\overline x)\) and tuples \(\overline m\) of natural numbers for which \(M\models \varphi(\nu\overline m)\) holds. A model \(M\) is called \(n\)-complete if, for each formula \(\varphi(x_ 1, \dots, x_ m)\) which has at most \(n\) alternations of quantifiers and for each tuple \(a_ 1,\dots, a_ m\in M\), there exists an \(\exists\)-formula \(\psi(x_ 1,\dots, x_ m)\) such that \(M\models \psi(x_ 1,\dots, x_ m)\) and \(M\models \forall\overline x(\varphi\to \psi)\). A model \(M\) is called limit-\(\omega\)-complete if, for any \(n\), it possesses a finite \(n\)-complete enrichment by constants, but it has no finite complete enrichments by constants. Theorem 1. If a model \(M\) is limit-\(\omega\)-complete and possesses a strong constructivization, then, given any computable class \(S\) of constructivizations of \(M\) we can effectively build a non-strong constructivization that is not equivalent to any constructivization from \(S\). Theorem 2. If \(M\) is strongly and weakly constructivizable, then, for a given computable class of its constructivizations, we can effectively build a weak constructivization of \(M\) that is not autoequivalent to any constructivization in this class. It follows that the class of weak constructivizations of a strongly constructivizable model is either empty or effectively infinite, and in this case, it is not computable.
- Computable classes of constructivizations for models of finite constructivizability type
- Computable classes of constructive models with non-limit-equivalent indexations
- scientific article; zbMATH DE number 1534360
- scientific article; zbMATH DE number 4101163
- scientific article; zbMATH DE number 804044
- Autostability of models
- Autostability of models and Abelian groups
- Computable classes of constructivizations for models of finite constructivizability type
- scientific article; zbMATH DE number 4035802 (Why is no real title available?)
- scientific article; zbMATH DE number 3732033 (Why is no real title available?)
- scientific article; zbMATH DE number 3561335 (Why is no real title available?)
- scientific article; zbMATH DE number 3561336 (Why is no real title available?)
- Computable isomorphisms, degree spectra of relations, and Scott families
- Effective choice for relations and reducibilities in classes of constructive and positive models
- Effective choice operations on constructive and positive models
- Computable classes of constructivizations for models of finite constructivizability type
- Computable classes of constructivizations for models of infinite algorithmic dimension
- Constructivizable models with a linear structure of algebraic reducibility
- scientific article; zbMATH DE number 4164817 (Why is no real title available?)
- scientific article; zbMATH DE number 2047487 (Why is no real title available?)
- scientific article; zbMATH DE number 1534360 (Why is no real title available?)
- scientific article; zbMATH DE number 804044 (Why is no real title available?)
This page was built for publication: Effectively infinite classes of weak constructivizations of models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346921)
