Some classical model theoretic aspects of bounded shrub-depth classes

10/12/2020
by   Abhisekh Sankaran, et al.
0

We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the class TM_r, p(d) of p-labeled arbitrary graphs whose underlying unlabeled graphs have tree models of height d and r labels. We show that this class satisfies an extension of the classical Löwenheim-Skolem property into the finite and for MSO. This extension being a generalization of the small model property, we obtain that the graphs of TM_r, p(d) are pseudo-finite. In addition, we obtain as consequences entirely new proofs of a number of known results concerning bounded shrub-depth classes (of finite graphs) and TM_r, p(d). These include the small model property for MSO with elementary bounds, the classical compactness theorem from model theory over TM_r, p(d), and the equivalence of MSO and FO over TM_r, p(d) and hence over bounded shrub-depth classes. The proof for the last of these is via an adaptation of the proof of the classical Lindström's theorem characterizing FO over arbitrary structures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2022

Pseudo-finiteness of arbitrary graphs of bounded shrub-depth

We consider classes of arbitrary (finite or infinite) graphs of bounded ...
research
11/02/2018

A Generalization of the Łoś-Tarski Preservation Theorem - Dissertation Summary

This article gives a summary of the author's Ph.D. dissertation (arXiv:1...
research
12/09/2022

The unstable formula theorem revisited

We first prove that Littlestone classes, those which model theorists cal...
research
02/11/2019

All those EPPA classes (Strengthenings of the Herwig-Lascar theorem)

In this paper we prove a general theorem showing the extension property ...
research
09/04/2019

Classes of graphs with low complexity: the case of classes with bounded linear rankwidth

Classes with bounded rankwidth are MSO-transductions of trees and classe...
research
07/26/2023

Distributed Certification for Classes of Dense Graphs

A proof-labeling scheme (PLS) for a boolean predicate Π on labeled graph...
research
11/22/2014

Efficiently learning Ising models on arbitrary graphs

We consider the problem of reconstructing the graph underlying an Ising ...

Please sign up or login with your details

Forgot password? Click here to reset