Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets

&
Annals of Pure and Applied Logic 141 (3):437-441 (2006)
  Copy   BIBTEX

Abstract

Let μ be a universal lower enumerable semi-measure . Any computable upper bound for μ can be effectively separated from zero with a constant . Computable positive lower bounds for μ can be nontrivial and allow one to construct natural examples of hypersimple sets

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2005.12.007

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,928

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

On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (3):361-370.
Instability and Convergence Under Simple-Majority Rule: Results from Simulation of Committee Choice in Two-Dimensional Space. [REVIEW]David H. Koehler - 2001 - Theory and Decision 50 (4):305-332.
Finite Model Theory.Heinz-Dieter Ebbinghaus & Jörg Flum - 2005 - Springer.
Effective complexity as a measure of information content.James W. McAllister - 2003 - Philosophy of Science 70 (2):302-307.
On some sets of dictionaries whose ω ‐powers have a given.Olivier Finkel - 2010 - Mathematical Logic Quarterly 56 (5):452-460.
Ω-powers and descriptive set theory.Dominique Lecomte - 2005 - Journal of Symbolic Logic 70 (4):1210-1232.
Metrization of the Uniform Space and Effective Convergence.Y. Tsujii, T. Mori & M. Yasugi - 2002 - Mathematical Logic Quarterly 48 (S1):123-130.
Logical Aspects of Rates of Convergence in Metric Spaces.Eyvind Martol Briseid - 2009 - Journal of Symbolic Logic 74 (4):1401 - 1428.
Descriptive set theory of families of small sets.Étienne Matheron & Miroslav Zelený - 2007 - Bulletin of Symbolic Logic 13 (4):482-537.
The complexity of oddan.Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl & Frank Stephan - 2000 - Journal of Symbolic Logic 65 (1):1 - 18.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.

Analytics

Added to PP
2013-12-31

Downloads
25 (#633,530)

6 months
12 (#213,693)

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

Add more references