Strong and weak constructivization and computable families

From MaRDI portal
Publication:1217118


DOI10.1007/BF01463352zbMath0305.02061MaRDI 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


03C99: Model theory

03D99: Computability and recursion theory


Related Items

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



Cites Work