Strong and weak constructivization and computable families

DOI10.1007/BF01463352zbMath0305.02061OpenAlexW1979974835MaRDI QIDQ1217118

A. T. Nurtazin

Publication date: 1975

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01463352

Mathematics Subject Classification ID

Model theory (03C99) Computability and recursion theory (03D99)

Related Items (31)

Degree spectra and computable dimensions in algebraic structures ⋮ Inseparability in recursive copies ⋮ The computable dimension of ordered abelian groups ⋮ The index set of the groups autostable relative to strong constructivizations ⋮ Degrees of autostability relative to strong constructivizations of graphs ⋮ Degrees of autostability for prime Boolean algebras ⋮ Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations ⋮ Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations ⋮ A note on decidable categoricity and index sets ⋮ Autostability of prime models under strong constructivizations ⋮ On decidable categoricity and almost prime models ⋮ Recursively Categorical Linear Orderings ⋮ The index set of Boolean algebras autostable relative to strong constructivizations ⋮ Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Recursive properties of isomorphism types ⋮ Recursive properties of relations on models ⋮ Index Sets of Constructive Models that are Autostable Under Strong Constructivizations ⋮ Effective categoricity of equivalence structures ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Computable categoricity of trees of finite height ⋮ Decompositions of decidable abelian groups ⋮ Turing degrees of complete formulas of almost prime models ⋮ The degree of decidable categoricity of a model with infinite solutions for complete formulas ⋮ Effective categoricity of abelian \(p\)-groups ⋮ The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ The given ⋮ Degree Spectra of Relations on Computable Structures

Cites Work

• Unnamed Item

This page was built for publication: Strong and weak constructivization and computable families