Journal of Symbolic Logic 63 (3):1083-1094 (1998)
| Authors |
|
| Abstract |
We study partitions of Fraïssé limits of classes of finite relational structures where the partitions are encoded by infinite binary strings which are random in the sense of Kolmogorov-Chaitin
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.2307/2586728 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 71,464
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (no proxy)
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
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
A Classification of Orbits Admitting a Unique Invariant Measure.Nathanael Ackerman, Cameron Freer, Aleksandra Kwiatkowska & Rehana Patel - 2017 - Annals of Pure and Applied Logic 168 (1):19-36.
Similar books and articles
Notions of Relative Ubiquity for Invariant Sets of Relational Structures.Paul Bankston & Wim Ruitenburg - 1990 - Journal of Symbolic Logic 55 (3):948-986.
Kolmogorov Complexity for Possibly Infinite Computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Every 2-Random Real is Kolmogorov Random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.
Relational Structures Determined by Their Finite Induced Substructures.I. M. Hodkinson & H. D. Macpherson - 1988 - Journal of Symbolic Logic 53 (1):222-230.
To Appraise Developmental Difficulty or Mental Demand, Relational Complexity is Not Enough.Juan Pascual-Leone - 1998 - Behavioral and Brain Sciences 21 (6):843-844.
Complexity: From Formal Analysis to Final Action.Douglas Frye & Philip David Zelazo - 1998 - Behavioral and Brain Sciences 21 (6):836-837.
Algorithmic Information Theory and Undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
Symmetric Generalized Galois Logics.Katalin Bimbó & J. Michael Dunn - 2009 - Logica Universalis 3 (1):125-152.
Analytics
Added to PP index
2009-01-28
Total views
13 ( #772,731 of 2,520,747 )
Recent downloads (6 months)
1 ( #405,718 of 2,520,747 )
2009-01-28
Total views
13 ( #772,731 of 2,520,747 )
Recent downloads (6 months)
1 ( #405,718 of 2,520,747 )
How can I increase my downloads?
Downloads
