逻辑
Prokhorov's Theorem in probability theory states that a family $\Gamma$ of probability measures on a Polish space is tight if and only if every sequence in $\Gamma$ has a weakly convergent subsequence. Due to the highly non-constructive…
The notion of $\theta$-FAM-linkedness, introduced in the second author's master thesis, is a formalization of the notion of strong FAM limits for intervals, whose initial form and applications have appeared in the work of Saharon Shelah,…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
For a NIP theory $T$, a sufficiently saturated model $\mathfrak{C}$ of $T$, and an invariant (over some small subset of $\mathfrak{C}$) global type $p$, we prove that there exists a finest relatively type-definable over a small set of…
We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let $Mod(\tau)$ be the set of countable structures with universe $\omega$ in vocabulary $\tau$ topologized by the Scott topology. We show that an invariant…
On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local tabularity of a modal logic. The main results are the…
We construct an existentially undecidable complete discretely valued field of mixed characteristic with existentially decidable residue field and decidable algebraic part, answering a question by Anscombe-Fehm in a strong way. Along the…
Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…
We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We…
We construct a Borel maximal cofinitary group.
In Part 1 of this study we showed, for a wide range of geometries, that the relationships between their concept-sets are fully determined by those between their (affine) automorphism groups. In this (self-contained) part, we show how this…
We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of…
In this article we determine the implicational fragments of most of the known subintuitionistic logics.
We show that the satisfiability problem for the variable-free fragment of every modal logic containing classical propositional logic and contained in the weak Grzegorczyk logic is NP-hard. In particular, the variable-free fragments of the…
We give an example of an SOP theory $T$, such that any $L(M)$-formula $\varphi(x,y)$ with $|y|=1$ is NSOP. We show that any such $T$ must have the independence property. We also give a simplified proof of Lachlan's theorem that if every…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
We further develop the theoretical framework of proof mining, a program in mathematical logic that seeks to quantify and extract computational information from prima facie `non-computational' proofs from the mainstream mathematical…
Amalgamation is investigated in classes of involutive commutative residuated lattices that are neither divisible, nor integral, nor idempotent. We demonstrate that several subclasses of totally ordered involutive commutative residuated…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
I outline a new theory of truth that resolves the classical and constructive versions of the liar paradox. The theory features a provably consistent axiomatization of a global self-applicative truth predicate. Truth is defined using…