A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES
From MaRDI portal
Publication:5052014
DOI10.1017/jsl.2021.76OpenAlexW3202373729MaRDI QIDQ5052014
Publication date: 18 November 2022
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2021.76
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Logic year 1979--80, The University of Connecticut, USA
- On initial segments of computable linear orders
- Computable models of theories with few models
- An uncountably categorical theory whose only computably presentable model is saturated
- Limitwise monotonic sequences and degree spectra of structures
- Increasing η -representable degrees
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic functions, sets, and degrees on computable domains
- η-representation of sets and degrees
- Hierarchies of Boolean algebras
This page was built for publication: A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES