Random ℓ‐colourable structures with a pregeometry

Mathematical Logic Quarterly 63 (1-2):32-58 (2017)
  Copy   BIBTEX

Abstract

We study finite ℓ‐colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures by which colours are first randomly assigned to all 1‐dimensional subspaces and then relationships are assigned in such a way that the colouring conditions are satisfied but apart from this in a random way. We can then ask what the probability is that the resulting structure, where we now forget the specific colouring of the generating process, has a given property. With this measure we get the following results: (1) A zero‐one law. (2) The set of sentences with asymptotic probability 1 has an explicit axiomatisation which is presented. (3) There is a formula (not directly speaking about colours) such that, with asymptotic probability 1, the relation “there is an ℓ‐colouring which assigns the same colour to x and y” is defined by. (4) With asymptotic probability 1, an ℓ‐colourable structure has a unique ℓ‐colouring (up to permutation of the colours).

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

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

Locally modular geometries in homogeneous structures.Tapani Hyttinen - 2005 - Mathematical Logic Quarterly 51 (3):291.
The complexity of random ordered structures.Joel H. Spencer & Katherine St John - 2008 - Annals of Pure and Applied Logic 152 (1):174-179.
The complexity of random ordered structures.Joel Spencer & Katherine St John - 2008 - Annals of Pure and Applied Logic 152 (1-3):174-179.
Dimensions, matroids, and dense pairs of first-order structures.Antongiulio Fornasiero - 2011 - Annals of Pure and Applied Logic 162 (7):514-543.
Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.

Analytics

Added to PP
2017-04-29

Downloads
9 (#1,228,347)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Homogenizable structures and model completeness.Ove Ahlman - 2016 - Archive for Mathematical Logic 55 (7-8):977-995.

Add more citations