Pages that link to "Item:Q4922660"
From MaRDI portal
The following pages link to LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS (Q4922660):
Displaying 18 items.
- Limitwise monotonic reducibility on sets and on pairs of sets (Q292861) (← links)
- The Kierstead's conjecture and limitwise monotonic functions (Q1709678) (← links)
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism (Q1936277) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Limitwise monotonic spectra and their generalizations (Q2117781) (← links)
- Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups (Q2287042) (← links)
- Degrees of bi-embeddable categoricity of equivalence structures (Q2312081) (← links)
- On \(\Delta_2^0\)-categoricity of equivalence relations (Q2346952) (← links)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Limitwise monotonic sequences and degree spectra of structures (Q2845476) (← links)
- Computable completely decomposable groups (Q3190417) (← links)
- A Friedberg enumeration of equivalence structures (Q4596664) (← links)
- A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES (Q5052014) (← links)
- On Kierstead’s conjecture (Q5227998) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- Rogers semilattices of limitwise monotonic numberings (Q6094148) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)