Random l-colourable structures with a pregeometry
Ove Ahlman, Vera Koponen

TL;DR
This paper investigates the properties of finite l-colourable structures with pregeometry, establishing a zero-one law, explicit axiomatization, and definability of colour relations under a specific probabilistic model.
Contribution
It introduces a probabilistic model for generating l-colourable structures with pregeometry and proves key logical properties including a zero-one law and definability results.
Findings
Proves a zero-one law for the class of structures.
Provides an explicit axiomatization for almost sure properties.
Shows the colour relation is definable by a specific formula.
Abstract
We study finite -colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures (with a given underlying pregeometry) 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
