Some Results in Computability Theory

Bulletin of Symbolic Logic 25 (4):452-453 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2019.50

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

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

Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Lattice representations for computability theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Set theory, model theory, and computability theory.Wilfrid Hodges - 2011 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press. pp. 471.
Maximal computability structures.Zvonko Iljazović & Lucija Validžić - 2016 - Bulletin of Symbolic Logic 22 (4):445-468.
Computability theory, nonstandard analysis, and their connections.Dag Normann & Sam Sanders - 2019 - Journal of Symbolic Logic 84 (4):1422-1465.
Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Beckmann Arnold, Berger Ulrich, Löwe Benedikt & Tucker John V. (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Springer. pp. 575--583.
Introduction to Computability Theory.D. Normann - 2010

Analytics

Added to PP
2022-11-14

Downloads
5 (#1,545,527)

6 months
3 (#984,214)

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

No references found.

Add more references