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

Other Versions

No versions found

Links

PhilArchive



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

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

On the contrapositive of countable choice.Hajime Ishihara & Peter Schuster - 2011 - Archive for Mathematical Logic 50 (1-2):137-143.
Polynomial-time versus recursive models.Douglas Cenzer & Jeffrey Remmel - 1991 - Annals of Pure and Applied Logic 54 (1):17-58.
Logics that define their own semantics.H. Imhof - 1999 - Archive for Mathematical Logic 38 (8):491-513.
Recursive properties of relations on models.Geoffrey R. Hird - 1993 - Annals of Pure and Applied Logic 63 (3):241-269.
Hyperarithmetical relations in expansions of recursive structures.Alan D. Vlach - 1994 - Annals of Pure and Applied Logic 66 (2):163-196.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Iterated multiplication in $$ VTC ^0$$ V T C 0.Emil Jeřábek - 2022 - Archive for Mathematical Logic 61 (5):705-767.

Analytics

Added to PP
2010-04-17

Downloads
36 (#629,586)

6 months
3 (#1,473,720)

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