Related papers: Model-theoretic dividing lines via posets
For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that…
We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…
Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.
A new class UF of problems is introduced, strictly included in the class NP, which arises in the analysis of the time verifying the intermediate results of computations. The implications of the introduction of this class are considered.…
Text-guided image generation enables the creation of visual content from textual descriptions. However, certain visual concepts cannot be effectively conveyed through language alone. This has sparked a renewed interest in utilizing the CLIP…
We introduce a class of proper posets which is preserved under countable support iterations, includes $\omega^\omega$-bounding, Cohen, Miller, and Mathias posets associated to filters with the Hurewicz covering properties, and has the…
$IP$ sets play fundamental role in arithmetic Ramsey theory. A set is called an additive $IP$ set if it is of the form $FS\left(\langle x_{n}\rangle_{n\in \mathbb{N}}\right)=\left\{ \sum_{t\in H}x_{t}:H\right.$ is a nonempty finite subset…
The Solomon-Tits theorem says that the poset of proper non-trivial subspaces of a finite-dimensional vector space has realisation equivalent to a wedge of spheres. In this paper we prove a variant of this result for collections of geodesic…
Stanley and Grinberg introduced a symmetric function associated with digraphs and named it the Redei-Berge symmetric function. This function arises from a suitable combinatorial Hopf algebra on digraphs, which made it possible to assign the…
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…
A poset-stratified space is a pair $(S, S \xrightarrow \pi P)$ of a topological space $S$ and a continuous map $\pi: S \to P$ with a poset $P$ considered as a topological space with its associated Alexandroff topology. In this paper we show…
Various topological concepts are often involved in the research of mathematical logic, and almost all of these concepts can be regarded as developing from the Stone representation theorem. In the Stone representation theorem, a Boolean…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…
We consider the situation in which some class of structures has the Strong Amalgamation Property (SAP) with the further requirement that the amalgamating structure can be taken over the set theoretical union of (the images of) the domains…
In [14] Hemmer conjectures that the module of fixed points for the symmetric group $\Sigma_m$ of a Specht module for $\Sigma_n$ (with $n>m$), over a field of positive characteristic $p$, has a Specht series, when viewed as a…
We introduce OpSets, an executable framework for specifying and reasoning about the semantics of replicated datatypes that provide eventual consistency in a distributed system, and for mechanically verifying algorithms that implement these…
Spencer and Shelah [ShSp:304] constructed for each irrational alpha between 0 and 1 the theory T^alpha as the almost sure theory of random graphs with edge probability n^{- alpha}. In [BlSh:528] we proved that this was the same theory as…
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL…