Related papers: On duality and model theory for polyadic spaces
In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…
I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…
There are several prominent duality results in pointfree topology. The Hofmann-Lawson duality establishes that the category of continuous frames is dually equivalent to the category of locally compact sober spaces. This restricts to a dual…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We use duality theorems to obtain presentations of some categories of modules. To derive these presentations we generalize a result of Cautis-Kamnitzer-Morrison [arXiv:1210.6437v4]: Let $\mathfrak{g}$ be a reductive Lie algebra, and $A$ an…
This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…
We start a systematic investigation of the size of Craig interpolants, uniform interpolants, and strongest implicates for (quasi-)normal modal logics. Our main upper bound states that for tabular modal logics, the computation of strongest…
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…
It is well known that the completeness theorem for $\mathrm{L}_{\omega_1\omega}$ fails with respect to Tarski semantics. Mansfield showed that it holds for $\mathrm{L}_{\infty\infty}$ if one replaces Tarski semantics with boolean valued…
We introduce the notion of a contramodule over a cocommutative coalgebra in a presentably symmetric monoidal $\infty$-category $\mathcal{C}$, and prove a symmetric monoidal $\infty$-categorical version of Positselski's comodule-contramodule…
This paper is a historical tour of occurrences of the Craig interpolation theorem and the Beth definability theorem in philosophy since the 1950s. We identify the notion of dependence as one major red thread behind these, and include some…
This paper develops a duality theory for connected cochain DG algebras, with particular emphasis on the non-commutative aspects. One of the main items is a dualizing DG module which induces a duality between the derived categories of DG…
We identify and highlight certain landmark results in Samson Abramsky's work which we believe are fundamental to current developments and future trends. In particular, we focus on the use of (i) topological duality methods to solve problems…
We review the notion of symplectic duality earlier introduced in the context of topological recursion. We show that the transformation of symplectic duality can be expressed as a composition of $x-y$ dualities in a broader context of log…
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…
The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and extensional completeness with respect…
Uniform interpolation properties are defined for equational consequence in a variety of algebras and related to properties of compact congruences on first the free and then the finitely presented algebras of the variety. It is also shown,…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…