Related papers: The Power of the Weak
In this thesis we present an introduction to Soft-Collinear Effective Theory, which can be used to prove (or disprove) factorization theorems to all orders in the strong coupling constant for some B decays into light and energetic…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that…
There are two main constructions in classical descent theory: the category of algebras and the descent category, which are known to be examples of weighted bilimits. We give a formal approach to descent theory, employing formal consequences…
Intuitionistic logic, in which the double negation law not-not-P = P fails, is dominant in categorical logic, notably in topos theory. This paper follows a different direction in which double negation does hold. The algebraic notions of…
We prove a product theorem for sublinear bilipschitz equivalences which generalizes the classical work of Kapovich, Kleiner and Leeb on quasiisometries between product spaces. We employ our product theorem to distinguish up to quasiisometry…
Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…
The modal mu-calculus is obtained by adding least and greatest fixed-point operators to modal logic. Its alternation hierarchy classifies the mu-formulas by their alternation depth: a measure of the codependence of their least and greatest…
Moisil logic, having as algebraic counterpart \L ukasiewicz-Moisil algebras, provide an alternative way to reason about vague information based on the following principle: a many-valued event is characterized by a family of Boolean events.…
We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…
Denote by $\P_n$ the set of $n\times n$ positive definite matrices. Let $D = D_1\oplus \dots \oplus D_k$, where $D_1\in \P_{n_1}, \dots, D_k \in \P_{n_k}$ with $n_1+\cdots + n_k=n$. Partition $C\in \P_n$ according to $(n_1, \dots, n_k)$ so…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…
This paper is about an extension of monadic second-order logic over the full binary tree, which has a quantifier saying ``almost surely a branch {\pi} \in {0, 1}^w satisfies a formula {\phi}({\pi})''. This logic was introduced by…
In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…
We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments. We combine the simpler version of Sanov's Theorem for discrete finite spaces and well chosen finite…
In this paper we study the tensor product for MV-algebras, the algebraic structures of \L ukasiewicz $\infty$-valued logic. Our main results are: the proof that the tensor product is preserved by the categorical equivalence between the…
Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…
Suszko's problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two…