Tianyuan Workshop — Open Problems in Mathematical Logic
All 22 numbered problems from the August 2026 version, with contributor context and definitions. Nested subquestions remain grouped.
22 catalogue entries · 22 new problem records · 22 catalogue entries linked to problem records
Catalogue entries can be source pointers, solved items or groups of questions. They are not added to the main problem count. Status reflects the saved source, inspected 2026-09-10.
Original collection ↗Attribution and reuse
http://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.
22 matching entries
Clear filtersCombining chains of random Turing degrees — Problem 1.1
Status unassessed1. George Barmpalias
Full-measure sets and random degree chains — Problem 1.2
Status unassessed1. George Barmpalias
Chains of 2-random reals without a single generator — Problem 1.3
Status unassessed1. George Barmpalias
Jumps and complexity within 2-random chains — Problem 1.4
Status unassessed1. George Barmpalias
Injective randomness-preserving one-way functions — Problem 1.5
Status unassessed1. George Barmpalias
Outer automorphisms of oligomorphic groups — Problem 2.1
Status unassessedOligomorphic groups
Strong jump traceability versus LR reducibility — Problem 2.2
Status unassessedComputability Theory
Computability Theory
Fourth-level quantifier-pattern degrees — Problem 3.1
Status unassessed3. Takayuki Kihara
Deciding reducibility of quantifier patterns — Problem 3.2
Status unassessed3. Takayuki Kihara
Kakeya sets whose points compute the halting problem — Problem 4.1
Status unassessed4. Liang Yu
Minimal subsets of Borel Kakeya sets — Problem 4.2
Status unassessed4. Liang Yu
Borel two-point sets — Problem 5.1
Status unassessed5. Jialiang He
Algebraic closures of Borel fields — Problem 5.2
Status unassessed5. Jialiang He
Choice needed for bases over a fixed field — Problem 6.1
Status unassessed6. Chieu-Minh Tran
A Davies example provable in ZFC — Problem 7.1
Status unassessed7. Theodore Slaman
Forcing models satisfying the genericity property — Problem 8.1
Status unassessed8. Hang Zhang
Hyperfiniteness of the forcing equivalence relation — Problem 8.2
Status unassessed8. Hang Zhang
Large-cardinal strength of the genericity property — Problem 8.3
Status unassessed8. Hang Zhang
Extending the random-degree result to LR degrees — Problem 9.1
Status unassessed9. Daniel Turetsky
Monotone induction and strong nesting — Problem 10.1
Status unassessed10. Philip Welch
11. Su Gao