Computability, homotopy and twisted Cartesian products
HTML articles powered by AMS MathViewer
- by Kathryn Weld PDF
- Proc. Amer. Math. Soc. 108 (1990), 1073-1076 Request permission
Abstract:
We prove that finite presentations of ${\pi _n}X$ are effectively computable, when $X$ is a connected, effectively locally finitely dominated nilpotent complex. The relationship between the solvability of the homotopy problem in recursive Kan complexes and the word problem in homotopy groups plays a role.References
-
E. H. Brown Jr., Computability of Postnikov complexes, Ann. of Math. 65 (1957), 1-20.
- D. L. Johnson, Topics in the theory of group presentations, London Mathematical Society Lecture Note Series, vol. 42, Cambridge University Press, Cambridge-New York, 1980. MR 695161, DOI 10.1017/CBO9780511629303
- J. Peter May, Simplicial objects in algebraic topology, Van Nostrand Mathematical Studies, No. 11, D. Van Nostrand Co., Inc., Princeton, N.J.-Toronto, Ont.-London, 1967. MR 0222892
- C. T. C. Wall, Finiteness conditions for $\textrm {CW}$-complexes, Ann. of Math. (2) 81 (1965), 56β69. MR 171284, DOI 10.2307/1970382
- Kathryn Weld, Computability of homotopy groups of nilpotent complexes, J. Pure Appl. Algebra 48 (1987), no.Β 1-2, 39β53. MR 915988, DOI 10.1016/0022-4049(87)90106-X
Additional Information
- © Copyright 1990 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 108 (1990), 1073-1076
- MSC: Primary 55Q52; Secondary 55S45
- DOI: https://doi.org/10.1090/S0002-9939-1990-0994794-8
- MathSciNet review: 994794