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

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
Keywords Legacy
Categories (categorize this paper)
DOI 10.1007/s001530050125
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,577
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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

Add more references

Citations of this work BETA

No citations found.

Add more citations

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.
Accessible Recursive Functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.

Analytics

Added to PP index
2010-04-17

Total views
25 ( #460,449 of 2,533,585 )

Recent downloads (6 months)
2 ( #261,212 of 2,533,585 )

How can I increase my downloads?

Downloads

My notes