The following pages link to Chris J. Conidis (Q402445):
Displaying 18 items.
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- The computability, definability, and proof theory of Artinian rings (Q1628418) (← links)
- (Q1949168) (redirect page) (← links)
- Galvin's ``racing pawns'' game, internal hyperarithmetic comprehension, and the law of excluded middle (Q1949169) (← links)
- The complexity of module radicals (Q1982020) (← links)
- On the complexity of radicals in noncommutative rings (Q2655033) (← links)
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem (Q2841359) (← links)
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (Q2892669) (← links)
- Chain conditions in computable rings (Q3065750) (← links)
- Effective packing dimension of $\Pi ^0_1$-classes (Q3533884) (← links)
- Classifying model-theoretic properties (Q3617367) (← links)
- Tensor operators and constructing indecomposable representations of semidirect product groups (Q4833030) (← links)
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation (Q4916553) (← links)
- The complexity of ascendant sequences in locally nilpotent groups (Q5418658) (← links)
- Transfinitely valued Euclidean domains have arbitrary indecomposable order type (Q5743058) (← links)
- D. D. Dzhafarov <scp>and</scp> C. Mummert, <i>Reverse Mathematics: Problems, Reductions, and Proofs.</i> Theory and Applications of Computability. Springer Nature, Cham, 2022, xix + 488 pp. (Q6199177) (← links)
