Related papers: Induction on Dilators and Bachmann-Howard Fixed Po…
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
We introduce a new functor on categories of modular representations of reductive algebraic groups. Our functor has remarkable properties. For example it is a tensor functor and sends every standard and costandard object in the principal…
This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…
We consider compact invariant sets \Lambda for C^{1} maps in arbitrary dimension. We prove that if \Lambda contains no critical points then there exists an invariant probability measure with a Lyapunov exponent \lambda which is the minimum…
A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…
The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad\'amek (1974) starts with the initial object (e.g. the empty…
Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…
We introduce real induction, a proof technique analogous to mathematical induction but applicable to statements indexed by an interval on the real line. More generally we give an inductive principle applicable in any Dedekind complete…
Rademacher's Theorem can be interpreted as an almost-everywhere \emph{little-$o$ improvement principle}: if a function admits a uniform pointwise first-order Lipschitz control at every point, then this control improves to a vanishing one at…
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…
In this survey article (which hitherto is an ongoing work-in-progress) we present the formulation of the induction and coinduction principles using the language and conventions of each of order theory, set theory, programming languages'…
Suppose G is a real reductive Lie group in Harish-Chandra's class. We propose here a structure for the set \Pi_u(G) of equivalence classes of irreducible unitary representations of G. (The subscript u will be used throughout to indicate…
Let $G$ be a simply connected, connected completely solvable Lie group with Lie algebra $\mathfrak{g}=\mathfrak{p}+\mathfrak{m}.$ Next, let $\pi$ be an infinite-dimensional unitary irreducible representation of $G$ obtained by inducing a…
Happel constructed a fully faithful functor $\mathcal{H} :\mathsf{D}^{\mathrm{b}}(\text{mod} \ \Lambda) \to \underline{\text{mod}}^{\Bbb{Z}} \ \text{T}(\Lambda)$ for a finite dimensional algebra $\Lambda$. He also showed that this functor…
Fra\"iss\'e's conjecture (proved by Laver) is implied by the $\Pi^1_1$-comprehension axiom of reverse mathematics, as shown by Montalb\'an. The implication must be strict for reasons of quantifier complexity, but it seems that no better…
This work exploits the logical foundation of session types to determine what kind of type discipline for the pi-calculus can exactly capture, and is captured by, lambda-calculus behaviours. Leveraging the proof theoretic content of the…
Let $\mathcal{X}$ be a resolving and contravariantly finite subcategory of $\rm{mod}\mbox{-}\Lambda$, the category of finitely generated right $\Lambda$-modules. We associate to $\mathcal{X}$ the subcategory…
In this paper we construct an analogue of Lurie's "unstraightening" construction that we refer to as the "comprehension construction". Its input is a cocartesian fibration $p \colon E \to B$ between $\infty$-categories together with a third…
We present a computable algorithm that assigns probabilities to every logical statement in a given formal language, and refines those probabilities over time. For instance, if the language is Peano arithmetic, it assigns probabilities to…
We demonstrate the common bihamiltonian nature of several integrable systems. The first one is an elliptic rotator that is an integrable Euler-Arnold top on the complex group GL(N) for any $N$, whose inertia ellipsiod is related to a choice…