Pages that link to "Item:Q4318310"
From MaRDI portal
The following pages link to Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310):
Displaying 33 items.
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- Linear orderings of low degree (Q610306) (← links)
- Cuts of linear orders (Q651418) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- Computably categorical Boolean algebras enriched by ideals and atoms (Q764268) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- On strongly jump traceable reals (Q925851) (← links)
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
- Decidable Boolean algebras of low level (Q1295398) (← links)
- Degree spectra of real closed fields (Q1734266) (← links)
- Coding and definability in computable structures (Q1782235) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Limitwise monotonic spectra and their generalizations (Q2117781) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- Rice sequences of relations (Q2941599) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- On the $n$-back-and-forth types of Boolean algebras (Q3116576) (← links)
- Boolean algebra approximations (Q3190798) (← links)
- On the triple jump of the set of atoms of a Boolean algebra (Q3508087) (← links)
- Notes on the Jump of a Structure (Q3576069) (← links)
- Depth zero Boolean algebras (Q3581139) (← links)
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
- COPYING ONE OF A PAIR OF STRUCTURES (Q5100056) (← links)
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS (Q5738187) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- Computable Stone spaces (Q6109093) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
