Related papers: Canonicity and normalisation for Dependent Type Th…
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…
We seek to learn a representation on a large annotated data source that generalizes to a target domain using limited new supervision. Many prior approaches to this problem have focused on learning "disentangled" representations so that as…
We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…
We discuss the Dempster-Shafer theory of evidence. We introduce a concept of monotonicity which is related to the diminution of the range between belief and plausibility. We show that the accumulation of knowledge in this framework exhibits…
We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…
We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…
We generalize the concept of Borel resummability and renormalons to a quantum field theory with an arbitrary number of fields and couplings, starting from the known notion based on the running coupling constants. An approach to identify the…
Renormalization group method is one of the most powerful tool to obtain approximate solutions to differential equations. We apply the renormalization group method to Hamiltonian systems whose integrable parts linearly depend on action…
We develop relativistic causality theory in the setting of point-free topology by introducing a notion of causal coverage in ordered locales, generalising their canonical coverage relation to incorporate causal structure. This improves…
We introduce a globally normalized transition-based neural network model that achieves state-of-the-art part-of-speech tagging, dependency parsing and sentence compression results. Our model is a simple feed-forward neural network that…
In this short note, we give a characterization of domains satisfying Serre's condition $(\mathrm{R}_1)$ in terms of their canonical modules. In the special case of toric rings, this generalizes a result of the second author (K. Yanagawa,…
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
Canonical quantisation gives a new and convenient finite-temperature perturbation theory in covariant gauges, and solves the problem of the zero-frequency mode in the temporal gauge. [Talk at Workshop on Thermal Field Theories and their…
We consider the union of certain irreducible components of cohomological support loci of the canonical bundle, which we call standard. We prove a structure theorem about them and single out some particular cases, recovering and improving…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…
We prove that every categorical model of dependent type theory with dependent sums and products, intensional identity types and univalent universes presents via its $\infty$-localisation an elementary $\infty$-topos, that is, a finitely…
We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras…
In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new…
Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…