Stability of recursive structures in arithmetical degrees

DOI10.1016/0168-0072(86)90048-5zbMath0631.03016OpenAlexW2047865735MaRDI QIDQ1094410

C. J. Ash

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90048-5

zbMATH Keywords

stabilityarithmetical hierarchyrecursive structure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (31)

Inseparability in recursive copies ⋮ Intrinsically \(\Sigma ^ 0_{\alpha}\) relations ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Requirement systems ⋮ Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 ⋮ A General Framework for Priority Arguments ⋮ Mixed systems ⋮ 1994–1995 Winter Meeting of the Association for Symbolic Logic ⋮ Strong degrees of categoricity and weak density ⋮ Pairs of recursive structures ⋮ Labelling systems and r.e. structures ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ Uncountable degree spectra ⋮ Sufficiency conditions for theories with recursive models ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ The property “arithmetic-is-recursive” on a cone ⋮ Stability among r.e. quotient algebras ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ The possible Turing degree of the nonzero member in a two element degree spectrum ⋮ PRIORITY ARGUMENTS VIA TRUE STAGES ⋮ On the Equimorphism Types of Linear Orderings ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Categoricity spectra of computable structures ⋮ Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees ⋮ Categoricity in hyperarithmetical degrees ⋮ INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Coding a family of sets ⋮ Abelian \(p\)-groups and autostability relative to an oracle ⋮ Hyperarithmetical relations in expansions of recursive structures ⋮ Criteria of autostability for 1-decidable models

Cites Work

• Recursive categoricity and recursive stability
• Autostability and computable families of constructivizations
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability of recursive structures in arithmetical degrees