Kirby Problem 5.16 for Noncommutative Semifree DGAs
Prior state unknown→disproved
resolves the noncommutative half of the Kirby-list problem
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topology / Decision problems in topology
Kirby Problem 5.16 for Noncommutative Semifree DGAs
For semifree noncommutative differential graded algebras over a nontrivial computable unital commutative ring, are stable tame isomorphism, quasi-isomorphism, or derived Morita equivalence algorithmically decidable? All three are undecidable.
20Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
For semifree noncommutative differential graded algebras over a nontrivial computable unital commutative ring, are stable tame isomorphism, quasi-isomorphism, or derived Morita equivalence algorithmically decidable? All three are undecidable.
resolves the noncommutative half of the Kirby-list problem
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.