UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
From MaRDI portal
Publication:4579805
DOI10.1017/jsl.2017.91OpenAlexW2886978637WikidataQ129431204 ScholiaQ129431204MaRDI QIDQ4579805
Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel D. Turetsky
Publication date: 10 August 2018
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/df886ac6dce48d80629d7c95a664b66a4aaef80e
Related Items (8)
On the complexity of the theory of a computably presented metric structure ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ On degree spectra of topological spaces ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ Computable topological groups and Pontryagin duality ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computable analysis and classification problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some geometric and dynamical properties of the Urysohn space
- Problem of the number of non-self-equivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Computable categoricity for pseudo-exponential fields of \(\aleph_1\)
- Computable structures and operations on the space of continuous functions
- Continuous first order logic and local stability
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- Finding bases of uncountable free abelian groups is usually difficult
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- The Classification Problem for Compact Computable Metric Spaces
- Computably Isometric Spaces
- The Arithmetical Hierarchy in the Setting of $\omega_1$
- Locally Computable Structures
This page was built for publication: UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
