Uniform procedures in uncountable structures

DOI10.1017/JSL.2017.91MaRDI QIDQ4579805zbMATH OpenOpenAlexWikidataFDO

Authors Noam Greenberg, Alexander Melnikov, J. F. Knight, Daniel Turetsky

Publication date 10 August 2018

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/df886ac6dce48d80629d7c95a664b66a4aaef80e

zbMATH Keywords

admissible recursion theoryeffective Polish spacerelative computable categoricity

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computably Isometric Spaces
• scientific article; zbMATH DE number 2167522
• Effective metric model theory
• Effective properties of sets and functions in metric spaces with computability structure
• Categoricity properties for computable algebraic fields

Cites work

• A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• Computability and uncountable linear orders. I: Computable categoricity.
• Computable categoricity for pseudo-exponential fields of _1
• Computable structures and operations on the space of continuous functions
• Computable structures and the hyperarithmetical hierarchy
• Computably Isometric Spaces
• Continuous first order logic and local stability
• Degree spectra and computable dimensions in algebraic structures
• Finding bases of uncountable free abelian groups is usually difficult
• scientific article; zbMATH DE number 6536307 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 2167522 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• Locally Computable Structures
• Problem of the number of non-self-equivalent constructivizations
• Some geometric and dynamical properties of the Urysohn space
• The arithmetical hierarchy in the setting of _1
• The classification problem for compact computable metric spaces

Cited in

(13)

• Computable analysis and classification problems
• On degree spectra of topological spaces
• Finding bases of uncountable free abelian groups is usually difficult
• Analytic computable structure theory and L^p spaces
• scientific article; zbMATH DE number 2167522 (Why is no real title available?)
• Computable topological groups and Pontryagin duality
• Effective metric model theory
• Computability of Polish spaces up to homeomorphism
• On the complexity of the theory of a computably presented metric structure
• COMPUTABLY COMPACT METRIC SPACES
• An arithmetic analysis of closed surfaces
• Computably and punctually universal spaces
• Computable presentations of C*-algebras

This page was built for publication: Uniform procedures in uncountable structures

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