scientific article
From MaRDI portal
Publication:3919698
zbMath0467.03041MaRDI QIDQ3919698
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classical first-order logic (03B10) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Recursive equivalence types of sets and structures, isols (03D50) Theory of numerations, effectively presented structures (03D45)
Related Items (35)
Degree spectra and computable dimensions in algebraic structures ⋮ Degree spectra of relations on structures of finite computable dimension ⋮ Inseparability in recursive copies ⋮ Recursive categoricity and recursive stability ⋮ Computable classes of constructivizations for models of finite constructivizability type ⋮ Recursion theory and ordered groups ⋮ Stability of recursive structures in arithmetical degrees ⋮ Effectively infinite classes of weak constructivizations of models ⋮ Possible degrees in recursive copies ⋮ Intrinsically \(\Sigma ^ 0_{\alpha}\) relations ⋮ Quasi-simple relations in copies of a given recursive structure ⋮ Permitting, forcing, and copying of a given recursive relation ⋮ Possible degrees in recursive copies. II ⋮ Generic copies of countable structures ⋮ Turing degrees of hypersimple relations on computable structures ⋮ On the triple jump of the set of atoms of a Boolean algebra ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ When Is Reachability Intrinsically Decidable? ⋮ Recursively Categorical Linear Orderings ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Some effects of Ash-Nerode and other decidability conditions on degree spectra ⋮ Uncountable degree spectra ⋮ Degree Spectra of Relations on a Cone ⋮ Recursive properties of relations on models ⋮ Every recursive Boolean algebra is isomorphic to one with incomplete atoms ⋮ Algorithmic properties of branching models ⋮ Categoricity and complexity of relations over algebraic structures ⋮ Turing degrees of certain isomorphic images of computable relations ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Coding a family of sets ⋮ On decidability of amenability in computable groups ⋮ Enumerations in computable structure theory ⋮ The given ⋮ Recursive linear orders with recursive successivities ⋮ Hyperarithmetical relations in expansions of recursive structures
This page was built for publication:
