- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Non-density in punctual computability
Annals of Pure and Applied Logic 172 (9):102985 (2021)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Relationships between computability-theoretic properties of problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.
Punctual Categoricity and Universality.Rod Downey, Noam Greenberg, Alexander Melnikov, Keng Meng Ng & Daniel Turetsky - 2020 - Journal of Symbolic Logic 85 (4):1427-1466.
Computability and uncountable linear orders I: Computable categoricity.Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky - 2015 - Journal of Symbolic Logic 80 (1):116-144.
Punctual definability on structures.Iskander Kalimullin, Alexander Melnikov & Antonio Montalban - 2021 - Annals of Pure and Applied Logic 172 (8):102987.
Scott complexity of countable structures.Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor & Dan Turetsky - 2021 - Journal of Symbolic Logic 86 (4):1706-1720.
Asymptotic density and computably enumerable sets.Rodney G. Downey, Carl G. Jockusch & Paul E. Schupp - 2013 - Journal of Mathematical Logic 13 (2):1350005.
Punctual Selves, Punctual Death, and the Health-Conscious Cogito: Descartes' Dead Bodies.Thomas F. Tierney - 2012 - Economy and Society 41 (2):258-81.
Should Computability Be Epistemic? a Logical and Physical Point of View.Florent Franchette - 2016 - Philosophies 1 (1):15--27.
Uniform procedures in uncountable structures.Noam Greenberg, Alexander G. Melnikov, Julia F. Knight & Daniel Turetsky - 2018 - Journal of Symbolic Logic 83 (2):529-550.
Analytics
Added to PP
2021-05-01
Downloads
49 (#1,198,260)
6 months
7 (#1,420,229)
2021-05-01
Downloads
49 (#1,198,260)
6 months
7 (#1,420,229)
Historical graph of downloads
Citations of this work
Punctually presented structures II: comparing presentations.Marina Dorzhieva, Rodney Downey, Ellen Hammatt, Alexander G. Melnikov & Keng Meng Ng - 2025 - Archive for Mathematical Logic 64 (1):159-184.
References found in this work
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
Foundations of online structure theory.Nikolay Bazhenov, Rod Downey, Iskander Kalimullin & Alexander Melnikov - 2019 - Bulletin of Symbolic Logic 25 (2):141-181.
Automatic and polynomial-time algebraic structures.Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Kalimullin, Alexander Melnikov & Keng Meng Ng - 2019 - Journal of Symbolic Logic 84 (4):1630-1669.
Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Every recursive linear ordering has a copy in dtime-space (n, log(n)).Serge Grigorieff - 1990 - Journal of Symbolic Logic 55 (1):260-276.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation