The following pages link to (Q4956005):
Displaying 45 items.
- On the ``heap'' problem (Q2424751) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Uniform \(m\)-equivalencies and numberings of classical systems (Q2667891) (← links)
- Learning algebraic structures with the help of Borel equivalence relations (Q2689445) (← links)
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets (Q2700822) (← links)
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories (Q2959176) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- Prime Model with No Degree of Autostability Relative to Strong Constructivizations (Q3195686) (← links)
- Spectra of Algebraic Fields and Subfields (Q3576055) (← links)
- On a question of Kalimullin (Q4563668) (← links)
- COMPUTABLE POLISH GROUP ACTIONS (Q4579801) (← links)
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES (Q4579805) (← links)
- A Friedberg enumeration of equivalence structures (Q4596664) (← links)
- DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION (Q4638977) (← links)
- Computable topological groups and Pontryagin duality (Q4691089) (← links)
- Effectively closed subgroups of the infinite symmetric group (Q4691363) (← links)
- Relativizing computable categoricity (Q5002563) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- (Q5155667) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- Decompositions of decidable abelian groups (Q5216188) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- A Computable Structure with Non-Standard Computability (Q5230801) (← links)
- On Decidable and Computable Models of Theories (Q5326370) (← links)
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- On the effective universality of mereological theories (Q6094132) (← links)
- Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
- Lower semilattices of separable congruences of numbered algebras (Q6175224) (← links)
- Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types (Q6187997) (← links)
- Every \(\Delta^0_2\) Polish space is computable topological (Q6554707) (← links)
- On the computability of ordered fields (Q6587462) (← links)
- Computably and punctually universal spaces (Q6614035) (← links)
- Computable Boolean algebras and complexity of the Fréchet ideal (Q6634567) (← links)
- On learning for families of algebraic structures (Q6634990) (← links)
- Numberings on admissible structures over equivalence relations (Q6634998) (← links)
- Computably separable numbering of locally finitely separable algebras (Q6643525) (← links)
