Strength and weakness in computable structure theory

DOI10.1007/978-3-319-50062-1_20MaRDI QIDQ2970966zbMATH OpenOpenAlexFDO

Authors Johanna N. Y. Franklin

Publication date 4 April 2017

Published in Computability and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-50062-1_20

Mathematics Subject Classification ID

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

Recommendations

• Degrees of categoricity of computable structures
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees that are not degrees of categoricity
• Degrees of categoricity on a cone via -systems
• Degrees of categoricity and spectral dimension

Cites work

• Algorithmic randomness and complexity.
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Computability and Randomness
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Degrees coded in jumps of orderings
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Degrees of categoricity on a cone via -systems
• Degrees that Are Low for Isomorphism
• Degrees that are not degrees of categoricity
• Descriptive set theory
• Effective procedures in field theory
• scientific article; zbMATH DE number 5722526 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 1302870 (Why is no real title available?)
• Lowness for isomorphism and degrees of genericity
• Non Σ_n axiomatizable almost strongly minimal theories
• On a hierarchy of sets. III
• On Schnorr and computable randomness, martingales, and machines
• PRIORITY ARGUMENTS VIA TRUE STAGES
• Randomness, relativization and Turing degrees
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Schnorr trivial reals: a construction
• Schnorr trivial sets and truth-table reducibility
• The atomic model theorem and type omitting
• The Friedberg-Muchnik Theorem Re-Examined

Cited in

(7)

• Finite computable dimension and degrees of categoricity
• Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
• Coding in the automorphism group of a computably categorical structure
• Every Δ20 degree is a strong degree of categoricity
• The strength of replacement in weak arithmetic
• Computable Heyting algebras with distinguished atoms and coatoms
• Degrees of categoricity and treeable degrees

This page was built for publication: Strength and weakness in computable structure theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970966)