Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 39 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 12 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 456 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Some classical model theoretic aspects of bounded shrub-depth classes (2010.05799v1)

Published 12 Oct 2020 in cs.LO

Abstract: We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the class $\mathrm{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\"owenheim-Skolem property into the finite and for $\mathrm{MSO}$. This extension being a generalization of the small model property, we obtain that the graphs of $\mathrm{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 $\mathrm{TM}{r, p}(d)$. These include the small model property for $\mathrm{MSO}$ with elementary bounds, the classical compactness theorem from model theory over $\mathrm{TM}{r, p}(d)$, and the equivalence of $\mathrm{MSO}$ and $\mathrm{FO}$ over $\mathrm{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\"om's theorem characterizing $\mathrm{FO}$ over arbitrary structures.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)