Application of a Tauberian theorem to finite model theory
dc.contributor.author | Compton, Kevin J. | en_US |
dc.date.accessioned | 2006-09-11T17:20:08Z | |
dc.date.available | 2006-09-11T17:20:08Z | |
dc.date.issued | 1985-12 | en_US |
dc.identifier.citation | Compton, Kevin J.; (1985). "Application of a Tauberian theorem to finite model theory." Archiv für Mathematische Logik und Grundlagenforschung 25(1): 91-98. <http://hdl.handle.net/2027.42/46064> | en_US |
dc.identifier.issn | 0933-5846 | en_US |
dc.identifier.issn | 1432-0665 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/46064 | |
dc.description.abstract | An extension of a Tauberian theorem of Hardy and Littlewood is proved. It is used to show that, for classes of finite models satisfying certain combinatorial and growth properties, Cesàro probabilities (limits of average probabilities over second order sentences) exist. Examples of such classes include the class of unary functions and the class of partial unary functions. It is conjectured that the result holds for the usual notion of asymptotic probability as well as Cesàro probability. Evidence in support of the conjecture is presented. | en_US |
dc.format.extent | 405225 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; Verlag W. Kohlhammer | en_US |
dc.subject.other | Algebra | en_US |
dc.subject.other | 03C13 | en_US |
dc.subject.other | CesàRo Probability | en_US |
dc.subject.other | 40G05 | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Mathematics, General | en_US |
dc.subject.other | Mathematical Logic and Foundations | en_US |
dc.subject.other | 40G10 | en_US |
dc.subject.other | Tauberian Theorem | en_US |
dc.subject.other | Finite Model Theory | en_US |
dc.subject.other | Asymptotic Probability | en_US |
dc.subject.other | Unary Function | en_US |
dc.title | Application of a Tauberian theorem to finite model theory | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, 48109-1109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/46064/1/153_2005_Article_BF02007559.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF02007559 | en_US |
dc.identifier.source | Archiv für Mathematische Logik und Grundlagenforschung | 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.