Descriptive Complexity and Reflective Properties of Combinatorial Configurations

DOI10.1112/JLMS/54.1.199zbMATH Open0857.68065OpenAlexW2036883974MaRDI QIDQ4894561FDOQ4894561

Authors: Willem Louw 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)

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894561)