Undecidability through Fourier series

&
Annals of Pure and Applied Logic 167 (7):507-524 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2016.03.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

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

Nonconvergence, undecidability, and intractability in asymptotic problems.Kevin J. Compton, C. Ward Henson & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 36:207.
Finite undecidability in PAC and PRC fields.Brian Tyrrell - 2024 - Annals of Pure and Applied Logic 175 (10):103465.
Undecidability of some elementary theories over pac fields.Gregory Cherlin & Moshe Jarden - 1986 - Annals of Pure and Applied Logic 30 (2):137-163.
An undecidability result for the asymptotic theory of p-adic fields.Konstantinos Kartas - 2023 - Annals of Pure and Applied Logic 174 (2):103203.
Undecidability of L(F∞) and other lattices of r.e. substructures.R. G. Downey - 1986 - Annals of Pure and Applied Logic 32:17-26.
Correction to “undecidability of L(F∞) and other lattices of r.e. substructures”.Rod Downey - 1990 - Annals of Pure and Applied Logic 48 (3):299-301.
Samuel R. Buss. The undecidability of k-provability. Annals of pure and applied logic, vol. 53 , pp. 75–102.Alessandra Carbone - 1997 - Journal of Symbolic Logic 62 (4):1480-1481.
Hans-Dieter Donder and Peter Koepke. On the consistency strength of ‘accessible’ Jonsson cardinals and of the weak Chang conjecture. Annals of pure and applied logic, vol. 25 , pp. 233–261. - Peter Koepke. Some applications of short core models. Annals of pure and applied logic, vol. 37 , pp. 179–204. [REVIEW]Sy D. Friedman - 1989 - Journal of Symbolic Logic 54 (4):1496-1497.
The undecidability of k-provability.Samuel Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.

Analytics

Added to PP
2016-06-30

Downloads
12 (#1,091,268)

6 months
6 (#701,066)

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

Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Two undecidable problems of analysis.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):49-77.
Decision problems for differential equations.J. Denef & L. Lipshitz - 1989 - Journal of Symbolic Logic 54 (3):941-950.

View all 6 references / Add more references