Nonconvergence, undecidability, and intractability in asymptotic problems
dc.contributor.author | Compton, Kevin J. | en_US |
dc.contributor.author | Ward Henson, C. | en_US |
dc.contributor.author | Shelah, Saharon | en_US |
dc.date.accessioned | 2006-04-07T20:00:57Z | |
dc.date.available | 2006-04-07T20:00:57Z | |
dc.date.issued | 1987 | en_US |
dc.identifier.citation | Compton, Kevin J., Ward Henson, C., Shelah, Saharon (1987)."Nonconvergence, undecidability, and intractability in asymptotic problems." Annals of Pure and Applied Logic 36(): 207-224. <http://hdl.handle.net/2027.42/26912> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6TYB-482YJNT-C/2/3bad8271dd0518648a5fa8e9c6524643 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/26912 | |
dc.description.abstract | Results delimiting the logical and effective content of asymptotic combinatorics are presented. For the class of binary relations with an underlying linear order, and the class of binary functions, there are properties, given by first-order sentences, without asymptotic probabilities; every first-order asymptotic problem (i.e., set of first-order sentences with asymptotic probabilities bounded by a given rational number between zero and one) for these two classes is undecidable. For the class of pairs of unary functions or permutations, there are monadic second-order properties without asymptotic probabilities; every monadic second-order asymptotic problem for this class is undecidable. No first-order asymptotic problem for the class of unary functions is elementary recursive. | en_US |
dc.format.extent | 1235182 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Nonconvergence, undecidability, and intractability in asymptotic problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | EECS Department, University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationum | EECS Department and Mathematics Department, University of Michigan, Ann Arbor, MI 48109, USA (Current address: Mathematics Dept., Hebrew Univ., Jerusalem, Israel) | en_US |
dc.contributor.affiliationother | Mathematics Department, University of Illinois, Urbana, IL 61801, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/26912/1/0000478.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0168-0072(87)90017-0 | en_US |
dc.identifier.source | Annals of Pure and Applied Logic | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.