Related papers: Modal model theory
For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…
Program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences $\varphi$ which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…
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…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…
We study modal separability for fixpoint formulae: given two mutually exclusive fixpoint formulae $\varphi,\varphi'$, decide whether there is a modal formula $\psi$ that separates them, that is, that satisfies…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…
This paper contributes to the theory of the modal $\mu$-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal $\mu$-calculus. For each of these…
Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…
Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…
A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…
We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the…
It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…