Kolmogorov complexity and symmetric relational structures

Journal of Symbolic Logic 63 (3):1083-1094 (1998)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

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

Recursive events in random sequences.George Davie - 2001 - Archive for Mathematical Logic 40 (8):629-638.
A Pigeonhole Property for Relational Structures.Anthony Bonato & Dejan Delić - 1999 - Mathematical Logic Quarterly 45 (3):409-413.
Fraïssé limits for relational metric structures.David Bryant, André Nies & Paul Tupper - 2021 - Journal of Symbolic Logic 86 (3):913-934.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
Big Ramsey degrees in universal inverse limit structures.Natasha Dobrinen & Kaiyun Wang - 2023 - Archive for Mathematical Logic 62 (3):471-503.
Fraïssé classes of graded relational structures.Guillermo Badia & Carles Noguera - 2018 - Theoretical Computer Science 737:81–90.

Analytics

Added to PP
2009-01-28

Downloads
47 (#462,611)

6 months
12 (#277,123)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Willem Fouché
University of South Africa

References found in this work

No references found.

Add more references