Skip to main content
SpringerLink
Log in

0-1 laws for recursive structures

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Mathematische Grundlagen der Informatik, RWTH Aachen, D-52062 Germany (e-mail: graedel@informatik.rwth-aachen.de; anders@informatik.rwth-aachen.de) , , , , , , DE

    E. Grädel & A. Malmström

Authors
  1. E. Grädel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Malmström
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: July 13, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grädel, E., Malmström, A. 0-1 laws for recursive structures. Arch Math Logic 38, 205–215 (1999). https://doi.org/10.1007/s001530050125

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050125

Search

Navigation