Pages that link to "Item:Q5718664"
From MaRDI portal
The following pages link to Up to equimorphism, hyperarithmetic is recursive (Q5718664):
Displaying 16 items.
- Computable bi-embeddable categoricity (Q1731326) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- Degrees of bi-embeddable categoricity of equivalence structures (Q2312081) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) (Q2693002) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- MASS PROBLEMS AND HYPERARITHMETICITY (Q3521596) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Degrees of bi-embeddable categoricity (Q4995600) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- Bi‐embeddability spectra and bases of spectra (Q5108859) (← links)
- ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE (Q5250130) (← links)
- Ranked structures and arithmetic transfinite recursion (Q5437595) (← links)
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS (Q5485751) (← links)
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS (Q5855748) (← links)
- Laver and set theory (Q5964933) (← links)
