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)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(87)90017-0

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

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

COMPTON, KJ, HENSON, CW and SHELAH, S., Noncon-vergence, undecidability and intractability in asymptotic problems DI PRISCO, CA and LLOPIS, J., On some extensions of the projective hierarchy. [REVIEW]Cw Henson - 1987 - Annals of Pure and Applied Logic 36:315.
An undecidability result for the asymptotic theory of p-adic fields.Konstantinos Kartas - 2023 - Annals of Pure and Applied Logic 174 (2):103203.
Saharon Shelah and Lee Stanley. A theorem and some consistency results in partition calculus. Annals of pure applied logic, vol. 36 , pp. 119–152. [REVIEW]James E. Baumgartner - 1990 - Journal of Symbolic Logic 55 (2):888-889.
Uri Abraham, Matatyahu Rubin, and Saharon Shelah. On the consistency of some partition theorems for continuous colorings, and the structure of ℵ 1 -dense real order types. Annals of pure and applied logic, vol. 29 (1985), pp. 123–206. [REVIEW]J. Steprāns - 2002 - Bulletin of Symbolic Logic 8 (2):303-305.
J. A. Makowsky, Saharon Shelah, and Jonathan Stavi. ⊿-logics and generalized quantifiers. Annals of mathematical logic, vol. 10 , pp. 155–192. [REVIEW]Jouko Vaananen - 1985 - Journal of Symbolic Logic 50 (1):241-242.
Judy Roitman. Height and width of superatomic Boolean algebras. Proceedings of the American Mathematical Society, vol. 94 , pp. 9–14. - James E. Baumgartner and Saharon Shelah. Remarks on superatomic Boolean algebras. Annals of pure and applied logic, vol. 33 , pp. 109–129. [REVIEW]Martin Weese - 1989 - Journal of Symbolic Logic 54 (3):1108-1109.
Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
Laszlo Fuchs and Saharon Shelah. Kaplansky's problem on valuation rings. Proceedings of the American Mathematical Society, vol. 105 , pp. 25–30. - Paul C. Eklof. A transfer theorem for nonstandard uniserials. Proceedings of the American Mathematical Society, vol. 114 , pp. 593–600. - Paul C. Eklof and Saharon Shelah. On a conjecture regarding nonstandard uniserial modules. Transactions of the American Mathematical Society, vol. 340 , pp. 337–351. - P. C. Eklof and S. Shelah. Explicitly non-standard uniserial modules. Journal of pure and applied algebra, vol. 86 , pp. 35–50. [REVIEW]Birge Huisgen-Zimmermann - 2002 - Bulletin of Symbolic Logic 8 (3):441-443.
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
25 (#869,013)

6 months
9 (#455,691)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.
Zero-one law and definability of linear order.Hannu Niemistö - 2009 - Journal of Symbolic Logic 74 (1):105-123.

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.

Add more references