Nonconvergence, undecidability, and intractability in asymptotic problems

Annals of Pure and Applied Logic 36:207 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,599

External links

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

Through your library

Similar books and articles

An undecidability result for the asymptotic theory of p-adic fields.Konstantinos Kartas - 2023 - Annals of Pure and Applied Logic 174 (2):103203.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.
The Hart-Shelah example, in stronger logics.Saharon Shelah & Andrés Villaveces - 2021 - Annals of Pure and Applied Logic 172 (6):102958.

Analytics

Added to PP
2014-01-16

Downloads
27 (#909,789)

6 months
5 (#860,126)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Zero-one law and definability of linear order.Hannu Niemistö - 2009 - Journal of Symbolic Logic 74 (1):105-123.
Zero-one laws with variable probability.Joel Spencer - 1993 - Journal of Symbolic Logic 58 (1):1-14.
Counting finite models.Alan R. Woods - 1997 - Journal of Symbolic Logic 62 (3):925-949.

Add more citations

References found in this work

The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Probabilities on finite models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.
An undecidable problem in finite combinatorics.Kevin J. Compton - 1984 - Journal of Symbolic Logic 49 (3):842-850.
Almost sure theories.James F. Lynch - 1980 - Annals of Mathematical Logic 18 (2):91.

View all 6 references / Add more references