Related papers: An Isbell Duality Theorem for Type Refinement Syst…
We describe an inductive machinery to prove various properties of representations of a category equipped with a generic shift functor. Specifically, we show that if a property (P) of representations of the category behaves well under the…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
We give two proofs to the following theorem and its generalization: if a finite dimensional algebra $A$ is derived equivalent to a smooth projective scheme, then any derived equivalence between $A$ and another algebra $B$ is standard, that…
Liquid typing provides a decidable refinement inference mechanism that is convenient but subject to two major issues: (1) inference is global and requires top-level annotations, making it unsuitable for inference of modular code components…
Refinement types are a well-studied manner of performing in-depth analysis on functional programs. The dependency pair method is a very powerful method used to prove termination of rewrite systems; however its extension to higher order…
Contrastive learning is a popular form of self-supervised learning that encourages augmentations (views) of the same input to have more similar representations compared to augmentations of different inputs. Recent attempts to theoretically…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…
We study imaginary representations of the Khovanov-Lauda-Rouquier algebras of affine Lie type. Irreducible modules for such algebras arise as simple heads of standard modules. In order to define standard modules one needs to have a cuspidal…
Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Data refinement is the standard extension of a refinement relation from programs to datatypes (i.e. a behavioural subtyping relation). Forward/backward simulations provide a tractable method for establishing data refinement, and have been…
We study (vertically) normal lax double functors valued in the weak double category $\mathbb{C}\mathrm{at}$ of small categories, functors, profunctors and natural transformations, which we refer to as lax double presheaves. We show that for…
Suitable duals of multimodules are introduced and used to provide transposition contravariant right semi-adjunctions (and dualitites under reflexivity). Several additional notions on multimodules are discussed: generalized morphisms and…
Ill-founded (or non-wellfounded) proof systems have emerged as a natural framework for inductive and coinductive reasoning. In such systems, soundness relies on global correctness criteria, such as the progressivity condition. Ensuring that…
We relate duality mappings to the "Babbage equation" F(F(z)) = z, with F a map linking weak- to strong-coupling theories. Under fairly general conditions F may only be a specific conformal transformation of the fractional linear type. This…
Iterative refinement -- start with a random guess, then iteratively improve the guess -- is a useful paradigm for representation learning because it offers a way to break symmetries among equally plausible explanations for the data. This…
It is well-known that pseudo functors from bicategories of spans are equivalent to Beck-Chevalley bifibrations, and therefore capture the relationships underlying the adjunctions suitable as semantics for existential quantification. This…
Structures where we have both a contravariant (pullback) and a covariant (pushforward) functoriality that satisfy base change can be encoded by functors out of ($\infty$-)categories of spans (or correspondences). In this paper we study the…
In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…
System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…