Related papers: Tameness in least fixed-point logic and McColm's c…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

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…

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…

Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…

Recursively defined linked data structures embedded in a pointer-based heap and their properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+lfp) with background theories. Such logics, unlike pure…

We prove a model theoretic Baire category theorem for $\tilde\tau_{low}^f$-sets in a countable simple theory in which the extension property is first-order and show some of its applications. We also prove a trichotomy for minimal types in…

Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order…

The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced…

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

We introduce a generalized notion of finiteness that provides a structural principle for the set of effective theories that can be consistently coupled to quantum gravity. More concretely, we propose a Tameness Conjecture that states that…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to…

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…

We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…

We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics $\mathcal{E\mkern-2mu…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…