Premium
Descriptive Complexity and Reflective Properties of Combinatorial Configurations
Author(s) -
Fouché W. L.
Publication year - 1996
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/54.1.199
Subject(s) - binary number , mathematics , combinatorics , combinatorial analysis , kolmogorov complexity , computer science , combinatorial principles , discrete mathematics , theoretical computer science , arithmetic , combinatorial explosion
We study the Ramsey theoretic properties of combinatorial configurations which are generated by infinite binary strings which are random in the sense of Kolmogorov‐Chaitin.