Randomness, computability and algebraic specifications

Annals of Pure and Applied Logic 91 (1):1-15 (1998)
  Copy   BIBTEX

Abstract

This paper shows how the notion of randomness defines, in a natural way, an algebra. It turns out that the algebra is computably enumerable and finitely generated. The paper investigates algebraic and effective properties of this algebra

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,934

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

Monadic Bounded Algebras.Galym Akishev & Robert Goldblatt - 2010 - Studia Logica 96 (1):1 - 40.
Recursive unary algebras and trees.Bakhadyr Khoussainov - 1994 - Annals of Pure and Applied Logic 67 (1-3):213-268.
Difference sets and computability theory.Rod Downey, Zoltán Füredi, Carl G. Jockusch & Lee A. Rubel - 1998 - Annals of Pure and Applied Logic 93 (1-3):63-72.
Finitely generated free Heyting algebras.Fabio Bellissima - 1986 - Journal of Symbolic Logic 51 (1):152-165.
Finitary algebraic logic II.Roger D. Maddux - 1993 - Mathematical Logic Quarterly 39 (1):566-569.
Provability algebras and proof-theoretic ordinals, I.Lev D. Beklemishev - 2004 - Annals of Pure and Applied Logic 128 (1-3):103-123.

Analytics

Added to PP
2014-01-16

Downloads
27 (#838,947)

6 months
4 (#1,288,968)

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

No references found.

Add more references