Descriptive Complexity and Reflective Properties of Combinatorial Configurations

DOI10.1112/jlms/54.1.199zbMath0857.68065OpenAlexW2036883974MaRDI QIDQ4894561

Willem L. Fouché

Publication date: 7 October 1996

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/54.1.199

zbMATH Keywords

Ramsey theorycombinatorial configurations

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (5)

Characterising the Martin-Löf random sequences using computably enumerable sets of measure one ⋮ Dynamics of a generic Brownian motion: Recursive aspects ⋮ Arithmetical representations of Brownian motion I ⋮ The descriptive complexity of Brownian motion ⋮ Kolmogorov complexity and symmetric relational structures

This page was built for publication: Descriptive Complexity and Reflective Properties of Combinatorial Configurations