Erich Grädel, Anders Malmström  Home/Search
Context
Related
| mgi.informatik.rwthaach...recursive.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mgi.informatik.rwthaachen.de/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Active bibliography (related documents): More All
0.5: 0-1 Laws for Recursive Structures - Grädel, Malmström (Correct)
0.2: More about Recursive Structures: Descriptive Complexity and.. - Hirst, Harel (1996) (Correct)
0.2: Towards a Theory of Recursive Structures - Harel (1998) (Correct)
Similar documents based on text: More All
0.7: Approximable Minimization Problems and Optimal Solutions on.. - Grädel, Malmström (1993) (Correct)
0.4: Inductive Definability with Counting on Finite Structures - Grädel, Otto (1993) (Correct)
0.3: Descriptive Complexity Theory over the Real Numbers - Grädel, Meer (1996) (Correct)
BibTeX entry: (Update)
@misc{ del-laws,
author = "Erich Grädel and Anders Malmström",
title = "0-1 Laws for Recursive Structures",
url = "citeseer.ist.psu.edu/720581.html" }
Citations (may not include all citations):142 Almost everywhere high nonuniform complexity - Lutz - 1992
81 Probabilities on finite models (context) - Fagin - 1976
49 Range and degree of realizability of formulas in the restric.. (context) - Glebskii, Kogan et al. - 1969
47 Zufalligkeit und Wahrscheinlichkeit (context) - Schnorr - 1971
31 laws in logic and combinatorics (context) - Compton - 1988
31 Concerning measures in first-order calculi (context) - Gaifman - 1964
14 Contributions to the Study of Resource-Bounded Measure - Mayordomo - 1994
7 More about Recursive Structures: Descriptive Complexity and .. - Hirst, Harel - 1996
5 Hamiltonian Paths in Infinite Graphs - Harel - 1991
Documents on the same site (http://www-mgi.informatik.rwth-aachen.de/Publications/): More
Game Logic is Strong Enough for Parity Games - Berwanger (Correct)
Why Are Modal Logics So Robustly Decidable? - Grädel (Correct)
Prefix-Recognisable Graphs and Monadic Second-Order Logic - Blumensath (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC