150 results in 03DXX
AN ORDER ANALYSIS OF HYPERFINITE BOREL EQUIVALENCE RELATIONS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 21 March 2025, pp. 1-23
-
- Article
- Export citation
On the algorithmic descriptive complexity of attractors in topological dynamics
- Part of
-
- Journal:
- Ergodic Theory and Dynamical Systems , First View
- Published online by Cambridge University Press:
- 10 March 2025, pp. 1-28
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 90 / Issue 1 / March 2025
- Published online by Cambridge University Press:
- 17 March 2025, pp. 364-390
- Print publication:
- March 2025
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
THE TREE PIGEONHOLE PRINCIPLE IN THE WEIHRAUCH DEGREES
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 11 February 2025, pp. 1-23
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
LEARNING EQUIVALENCE RELATIONS ON POLISH SPACES
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 03 February 2025, pp. 1-19
-
- Article
- Export citation
ON PROVING CONSISTENCY OF EQUATIONAL THEORIES IN BOUNDED ARITHMETIC
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 90 / Issue 1 / March 2025
- Published online by Cambridge University Press:
- 27 January 2025, pp. 135-165
- Print publication:
- March 2025
-
- Article
- Export citation
MANY-ONE REDUCIBILITY WITH REALIZABILITY
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 27 January 2025, pp. 1-39
-
- Article
- Export citation
THE WEIHRAUCH LATTICE AT THE LEVEL OF
$\boldsymbol {\Pi }^1_1{-}\mathsf{CA}_0$: THE CANTOR–BENDIXSON THEOREM
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 27 January 2025, pp. 1-39
-
- Article
- Export citation
THE COMPLEXITY OF ORDER-COMPUTABLE SETS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 24 January 2025, pp. 1-24
-
- Article
- Export citation
SCOTT SENTENCE COMPLEXITIES OF LINEAR ORDERINGS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 13 December 2024, pp. 1-30
-
- Article
-
- You have access
- HTML
- Export citation
A ONE-PAGE PROOF OF A THEOREM OF BELEZNAY
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 4 / December 2024
- Published online by Cambridge University Press:
- 18 March 2025, pp. 536-537
- Print publication:
- December 2024
-
- Article
-
- You have access
- HTML
- Export citation
Algorithmic Properties of Rogers Semilattices
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 4 / December 2024
- Published online by Cambridge University Press:
- 18 March 2025, pp. 544-545
- Print publication:
- December 2024
-
- Article
-
- You have access
- Export citation
A RECURSIVE COLORING FUNCTION WITHOUT
$ \Pi _3^0$ SOLUTIONS FOR HINDMAN’S THEOREM
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 29 October 2024, pp. 1-24
-
- Article
-
- You have access
- HTML
- Export citation
Effective dynamical systems beyond dimension zero and factors of SFTs
- Part of
-
- Journal:
- Ergodic Theory and Dynamical Systems / Volume 45 / Issue 5 / May 2025
- Published online by Cambridge University Press:
- 11 October 2024, pp. 1329-1369
- Print publication:
- May 2025
-
- Article
-
- You have access
- HTML
- Export citation
LIMIT COMPLEXITIES, MINIMAL DESCRIPTIONS, AND n-RANDOMNESS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 05 June 2024, pp. 1-16
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Many problems, different frameworks: classification of problems in computable analysis and algorithmic learning theory
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 2 / June 2024
- Published online by Cambridge University Press:
- 11 November 2024, pp. 287-288
- Print publication:
- June 2024
-
- Article
-
- You have access
- Export citation
POUR-EL’S LANDSCAPE
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 3 / September 2024
- Published online by Cambridge University Press:
- 09 May 2024, pp. 362-397
- Print publication:
- September 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
A
$ \prod _{2}^{0}$ SINGLETON OF MINIMAL ARITHMETIC DEGREE
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 08 April 2024, pp. 1-33
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 2 / June 2024
- Published online by Cambridge University Press:
- 08 April 2024, pp. 199-226
- Print publication:
- June 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Finite skew braces of square-free order and supersolubility
- Part of
-
- Journal:
- Forum of Mathematics, Sigma / Volume 12 / 2024
- Published online by Cambridge University Press:
- 18 March 2024, e39
-
- Article
-
- You have access
- Open access
- HTML
- Export citation