Related papers: Dynamic IFC Theorems for Free!
Often fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations they lead to false conclusions. This document presents a research agenda aiming at laying the foundations of…
We propose an algorithm to extract noise-robust acoustic features from noisy speech. We use Total Variability Modeling in combination with Non-negative Matrix Factorization (NMF) to learn a total variability subspace and adapt NMF…
We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
We present a novel approach for generalizing the IC3 algorithm for invariant checking from finite-state to infinite-state transition systems, expressed over some background theories. The procedure is based on a tight integration of IC3 with…
We point out that the leading infrared singular terms in the effective actions of noncommutative gauge theories arising from nonplanar loop diagrams have a natural interpretation in terms of the matrix model (operator) formulation of these…
We explore the idea of restoring the full diffeomorphism (Diff) invariance in theories with only transverse diffeomorphisms (TDiff) by the introduction of additional fields. In particular, we consider in detail the case of a TDiff invariant…
Gauge theories and perturbative gravity in four dimensions are governed by a tower of infinite-dimensional symmetries which arise from tree-level soft theorems. However, aside from the leading soft theorems which are all-loop exact,…
We prove Freudenburg's Freeness Conjecture: Let B be the polynomial ring in three variables over a field of characteristic zero, let D : B --> B be a nonzero locally nilpotent derivation, and let A = ker(D). Then B is a free A-module, and…
It is shown that background fields of a topological character usually introduced as such in compactified string theories correspond to quantum degrees of freedom which parametrise the freedom in choosing a representation of the zero mode…
When formalizing proofs with interactive theorem provers, it often happens that extra background knowledge (declarative or procedural) about mathematical concepts is employed without the formalizer explicitly invoking it, to help the…
We explore a background-independent theory of composite gravity. The vacuum expectation value of the composite metric satisfies Einstein's equations (with corrections) as a consistency condition, and selects the vacuum spacetime. A…
We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…
The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman. Starting from the basic language of quantifier-free…
Abstract argumentation has emerged as a method for non-monotonic reasoning that has gained popularity in the symbolic artificial intelligence community. In the literature, the different approaches to abstract argumentation that were refined…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
In this paper we present a new characterization of free group actions (in classical differential geometry), involving dynamical systems and representations of the corresponding transformation groups. In fact, given a dynamical system, we…
Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
This paper proposes a simple topological characterization of a large class of fair adversarial models via affine tasks: sub-complexes of the second iteration of the standard chromatic subdivision. We show that the task computability of a…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…