Non-density in punctual computability

, , &
Annals of Pure and Applied Logic 172 (9):102985 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2021.102985

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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 II: Degree spectra.Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky - 2015 - Journal of Symbolic Logic 80 (1):145-178.
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.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
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.
“Self Pontual”, Democracia e Ética da Autenticidade.Daniel Gomes & Maurício Guedes - 2017 - Revista Portuguesa de Filosofia 73 (1):305-322.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.
Lattice representations for computability theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.

Analytics

Added to PP
2021-05-01

Downloads
12 (#1,058,801)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.

View all 9 references / Add more references