Minimal functions on the random graph

Details Minimal functions on the random graph Minimal functions on the random graph

2010-03-21

arxiv.org/abs/1003.4030v2

Mathematics

Logic

32 pages; this is an extension of article 0903.2553 by the same authors

Scientific paper

We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions of this system by means of composition with automorphisms and by topological closure, and the system is minimal in the sense that no subset of the system has the same property. The theorem is obtained by proving a Ramsey-type theorem for colorings of tuples in finite powers of the random graph, and by applying this to find regular patterns in the behavior of any function on the random graph. As model-theoretic corollaries of our methods we re-derive a theorem of Simon Thomas classifying the first-order closed reducts of the random graph, and prove some refinements of this theorem; also, we obtain a classification of the minimal reducts closed under primitive positive definitions, and prove that all reducts of the random graph are model-complete.

Affiliated with

Also associated with

No associations

Rating

Minimal functions on the random graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal functions on the random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal functions on the random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-205851