Related papers: Monadic NIP in monotone classes of relational stru…
Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…
We give criteria for a first-order theory to be NCTP or NBTP using tree-indiscernibility. As an application, we show that Mekler's construction preserves NCTP and NBTP.
We introduce a new data structure for answering connectivity queries in undirected graphs subject to batched vertex failures. Precisely, given any graph G and integer k, we can in fixed-parameter time construct a data structure that can…
In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A.…
Complex networks are everywhere. They appear for example in the form of biological networks, social networks, or computer networks and have been studied extensively. Efficient algorithms to solve problems on complex networks play a central…
Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
Let $G$ be a multiplicative subgroup of $\mathbb{Q}_p$. In this paper, we describe the theory of the pair $(\mathbb{Q}_p, G)$ under the condition that $G$ satisfies Mann property and is small as subset of a first-order structure. First, we…
We prove special cases of a general conjecture: If an invertible field theory admits a projectively topological boundary theory, then it has finite order in the abelian group of invertible field theories. One can substitute `gapped' for…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
This paper addresses the problem of stabilization for infinite-dimensional systems. In particular, we design nonlinear stabilizers for both linear and nonlinear abstract systems. We focus on two classes of systems: the first class comprises…
The causal graph of a planning instance is an important tool for planning both in practice and in theory. The theoretical studies of causal graphs have largely analysed the computational complexity of planning for instances where the causal…
The celebrated theorem of Kechris, Pestov and Todor\v{c}evi\'c connecting structural Ramsey theory with topological dynamics has as a consequence that the Fra\"{\i}ss\'e limit of a Ramsey class of non-trivial finite relational structures…
We study model theory of actions of finite groups on substructures of a stable structure. We give an abstract description of existentially closed actions as above in terms of invariants and PAC structures. We show that if the corresponding…
It is not hard to write a first order formula which is true for a given graph G but is false for any graph not isomorphic to G. The smallest number $(G) of nested quantifiers in a such formula can serve as a measure for the ``first order…
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…
We introduce the class of strongly sofic monoids. This class of monoids strictly contains the class of sofic groups and is a proper subclass of the class of sofic monoids. We define and investigate sofic topological entropy for actions of…
We give several new equivalences of $NIP$ for formulas and new proofs of known results using [T87] and [HOR91]. We emphasize that Keisler measures are more complicated than types (even in $NIP$ context), in an analytic sense. Among other…