Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Vincent Guingona"'
Publikováno v:
Information Processing Letters. 182:106380
Autor:
Vincent Guingona, Miriam Parnes
In this paper, we introduce the notion of K-rank, where K is an strong amalgamation Fraisse class. Roughly speaking, the K-rank of a partial type is the number of "copies" of K that can be "independently coded" inside of the type. We study K-rank for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c747597131575df6e9884dcf73d2505e
http://arxiv.org/abs/2007.02922
http://arxiv.org/abs/2007.02922
Autor:
Vincent Guingona, Uri Andrews
Publikováno v:
Proceedings of the American Mathematical Society. 144:2241-2256
We show VC-minimality is 0 -complete. In particular, we give a local characterization of VC-minimality. We also show dp-smallness is 1 - complete.
Autor:
Vincent Guingona, Cameron Donnay Hill
Publikováno v:
Annals of Pure and Applied Logic. 166:502-525
In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing the order property, and use this to create
Autor:
Vincent Guingona, Joseph Flenner
Publikováno v:
Proceedings of the American Mathematical Society. 142:1849-1860
Two uniqueness results on representations of sets constructible in a directed family of sets are given. In the unpackable case, swiss cheese decompositions are unique. In the packable case, they are not unique but admit a quasi-ordering under which t
Autor:
Vincent Guingona
Publikováno v:
Archive for Mathematical Logic. 53:503-517
In this paper, we show that VC-minimal ordered fields are real closed. We introduce a notion, strictly between convexly orderable and dp-minimal, that we call dp-small, and show that this is enough to characterize many algebraic theories. For example
Autor:
Vincent Guingona, Cameron Donnay Hill
Publikováno v:
Mathematical Logic Quarterly. 60:59-65
In this paper, we study Vapnik-Chervonenkis density (VC-density) over indiscernible sequences (denoted VCind-density). We answer an open question in [1], showing that VCind-density is always integer valued. We also show that VCind-density and dp-rank
We use the notion of collapse of generalized indiscernible sequences to classify various model theoretic dividing lines. In particular, we use collapse of n-multi-order indiscernibles to characterize op-dimension n; collapse of function-space indisce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4997aa601170118236fa2114ae2384c1
Autor:
Vincent Guingona
We show that any formula with two free variables in a VC-minimal theory has VC-codensity at most two. Modifying the argument slightly, we give a new proof of the fact that, in a VC-minimal theory where acl = dcl, the VC-codensity of a formula is at m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::295c73e0e3e2240f81612486a73c4a7f
Autor:
Vincent Guingona, Joseph Flenner
We consider the model theoretic notion of convex orderability, which fits strictly between the notions of VC-minimality and dp-minimality. In some classes of algebraic theories, however, we show that convex orderability and VC-minimality are equivale
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71fd48b54b0460128b15559f76a6da74
http://arxiv.org/abs/1210.0404
http://arxiv.org/abs/1210.0404