0-1 laws for recursive structures

&
Archive for Mathematical Logic 38 (4-5):205-215 (1999)
  Copy   BIBTEX

Abstract

We discuss resource-bounded measures on the class of recursive structures and prove that with respect to such measures a random recursive structure is almost surely isomorphic to the unique countable model of the extension axioms

Categories

Keywords

Reprint years

DOI

10.1007/s001530050125

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

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

Recursive in a generic real.Juichi Shinoda & Theodore A. Slaman - 2000 - Journal of Symbolic Logic 65 (1):164-172.
Recursive distributed representations.Jordan B. Pollack - 1990 - Artificial Intelligence 46 (1-2):77-105.
Construction of models for algebraically generalized recursive function theory.H. R. Strong - 1970 - Journal of Symbolic Logic 35 (3):401-409.
Handbook of recursive mathematics.IUrii Leonidovich Ershov (ed.) - 1998 - New York: Elsevier.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
The relation of recursive isomorphism for countable structures.Riccardo Camerlo - 2002 - Journal of Symbolic Logic 67 (2):879-895.
Diagonalization in double frames.Andrzej Wiśniewski & Jerzy Pogonowski - 2010 - Logica Universalis 4 (1):31-39.
Recursive versus recursively enumerable binary relations.Dev K. Roy - 1993 - Studia Logica 52 (4):587 - 593.

Analytics

Added to PP
2010-04-17

Downloads
29 (#555,328)

6 months
2 (#1,206,545)

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

Probabilities on finite models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.

Add more references