Related papers: Characterizing the Exponential-Space Hierarchy Via…

We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class C of finite structures that can be…

We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient…

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

This paper seeks to apply categorical logic to the design of artificial intelligent agents that reason symbolically about objects more richly structured than sets. Using Johnstone's sequent calculus of terms- and formulae-in-context, we…

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Enumerating the result set of a first-order query over a relational structure of bounded degree can be done with linear preprocessing and constant delay. In this work, we extend this result towards the compressed perspective where the…

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…

We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…

The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the…

Inspired by the works in [1] and [8] we introduce what we call $k$-th-order fluctuation fields and study their scaling limits. This construction is done in the context of particle systems with the property of orthogonal self-duality. This…

We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very…

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

In the present article, we show the existence of a coupled fixed point for an order preserving mapping in a preordered left K-complete quasi-pseudometric space using a preorder induced by an appropriate function. We also define the concept…

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

Let X be a smooth hypersurface of degree d in P^n over an algebraically closed field of characteristic p. We show that X must be separably rationally connected and must contain a free line if either p is at least d or if p is at least d-1…

This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases…

We study extensions of expressive decidable fragments of first-order logic with circumscription, in particular the two-variable fragment FO$^2$, its extension C$^2$ with counting quantifiers, and the guarded fragment GF. We prove that if…

We consider the Zariski space of all places of an algebraic function field $F|K$ of arbitrary characteristic and investigate its structure by means of its patch topology. We show that certain sets of places with nice properties (e.g., prime…