Pages that link to "Item:Q5391560"
From MaRDI portal
The following pages link to A certain reducibility on admissible sets (Q5391560):
Displaying 26 items.
- Reducibility on families (Q431669) (← links)
- Descriptive properties on admissible sets (Q619320) (← links)
- On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models (Q662638) (← links)
- Fixed points for the jump operator (Q694226) (← links)
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability (Q1620784) (← links)
- A computable structure with nonstandard computability (Q1703284) (← links)
- Coding and definability in computable structures (Q1782235) (← links)
- Computable embeddings for pairs of linear orders (Q2055305) (← links)
- A note on computable embeddings for ordinals and their reverses (Q2106587) (← links)
- Minimal predicates for \(\Delta \)-definability (Q2213943) (← links)
- Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups (Q2287042) (← links)
- Processes and structures on approximation spaces (Q2401545) (← links)
- On functors enumerating structures (Q2403649) (← links)
- Rice sequences of relations (Q2941599) (← links)
- (Q3341381) (← links)
- (Q3446484) (← links)
- On existence of complete sets for bounded reducibilities (Q4452450) (← links)
- Jump inversions of algebraic structures and Σ‐definability (Q5108844) (← links)
- (Q5203001) (← links)
- A Computable Structure with Non-Standard Computability (Q5230801) (← links)
- On Processes and Structures (Q5326386) (← links)
- (Q5482032) (← links)
- New Computational Paradigms (Q5717076) (← links)
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY (Q5738191) (← links)
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER (Q6095975) (← links)
- Families of permutations and ideals of Turing degrees (Q6148009) (← links)
