Access the full text.
Sign up today, get DeepDyve free for 14 days.
K. Compton (1989)
Laws in Logic and Combinatorics
Ronald Fagin (1976)
Probabilities on finite modelsJournal of Symbolic Logic, 41
H. Gaifman (1964)
Concerning measures in first order calculiIsrael Journal of Mathematics, 2
Yu. Glebskii, D. Kogan, M. Liogon'kii, V. Talanov (1969)
Range and degree of realizability of formulas in the restricted predicate calculusCybernetics, 5
L. Balc, Peter Miltersen, E. Allender (1994)
Contributions to the Study of Resource-bounded Measure
(1971)
Zuff alligkeit und Wahrscheinlichkeit, volume 218 of Lecture Notes in Mathematics
J. Lutz (1989)
Almost everywhere high nonuniform complexity[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
T. Hirst, D. Harel (1996)
More about recursive structures: descriptive complexity and zero-one lawsProceedings 11th Annual IEEE Symposium on Logic in Computer Science
D. Harel (1991)
Hamiltonian paths in infinite graphsIsrael Journal of Mathematics, 76
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.
Archive for Mathematical Logic – Springer Journals
Published: May 1, 1999
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.