scientific article; zbMATH DE number 6536307
From MaRDI portal
Publication:3464657
zbMATH Open1369.03116MaRDI QIDQ3464657FDOQ3464657
Authors: Noam Greenberg, J. F. Knight 
Publication date: 27 January 2016
Title of this publication is not available (Why is that?)
Recommendations
- Computability theory in admissible domains
- On principles of computability on admissible sets
- scientific article; zbMATH DE number 2047478
- On an ad hoc computability structure in a Hilbert space
- On \(\Sigma^0_1\)-classification of relations on computable structures
- Computable Structure Theory
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- Some results on \(\mathbb{R}\)-computable structures
- Computable structures and the hyperarithmetical hierarchy
- Publication:4863247
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cited In (11)
- Uniform procedures in uncountable structures
- Computability in uncountable binary trees
- A computable structure with non-standard computability
- Computable categoricity for pseudo-exponential fields of \(\aleph_1\)
- The arithmetical hierarchy in the setting of \(\omega_1\)
- COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS
- Complexity profiles and generic Muchnik reducibility
- Classes of structures with universe a subset of \(\omega _{1}\)
- Computability and uncountable linear orders. I: Computable categoricity.
- Computably categorical structures and expansions by constants
- Finding bases of uncountable free abelian groups is usually difficult
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464657)
