English
Related papers

Related papers: Induction on Dilators and Bachmann-Howard Fixed Po…

200 papers

Given a complex structure $J$ on a real (finite or infinite dimensional) Hilbert space $H$, we study the geometry of the Lagrangian Grassmannian $\Lambda(H)$ of $H$, i.e. the set of closed linear subspaces $L\subset H$ such that…

Differential Geometry · Mathematics 2009-11-13 Esteban Andruchow , Gabriel Larotonda

The $\lambda$$\Pi$-calculus modulo theory is an extension of simply typed $\lambda$-calculus with dependent types and user-defined rewrite rules. We show that it is possible to replace the rewrite rules of a theory of the…

Logic in Computer Science · Computer Science 2024-02-15 Valentin Blot , Gilles Dowek , Thomas Traversié , Théo Winterhalter

We present a simplified and streamlined characterisation of provably total computable functions of the theory ID_1 of non-iterated inductive definitions. The idea of the simplification is to employ the method of operator-controlled…

Logic · Mathematics 2012-05-15 Naohi Eguchi , Andreas Weiermann

Recursively defined linked data structures embedded in a pointer-based heap and their properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+lfp) with background theories. Such logics, unlike pure…

Logic in Computer Science · Computer Science 2022-09-27 Adithya Murali , Lucas Peña , Eion Blanchard , Christof Löding , P. Madhusudan

Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we…

Computational Complexity · Computer Science 2019-08-15 Bruce M. Kapron , Florian Steinberg

We propose an operator generalization of the Li-Haldane conjecture regarding the entanglement Hamiltonian of a disk in a 2+1D chiral gapped groundstate. The logic applies to regions with sharp corners, from which we derive several universal…

Strongly Correlated Electrons · Physics 2026-02-06 Xiang Li , Ting-Chun Lin , Yahya Alavirad , John McGreevy

In Inverse subsumption for complete explanatory induction Yamamoto et al. investigate which inductive logic programming systems can learn a correct hypothesis $H$ by using the inverse subsumption instead of inverse entailment. We prove that…

Artificial Intelligence · Computer Science 2014-07-16 David Toth

In CSL'99 Roversi pointed out that the Turing machine encoding of Girard's seminal paper "Light Linear Logic" has a flaw. Moreover he presented a working version of the encoding in Light Affine Logic, but not in Light Linear Logic. In this…

Logic in Computer Science · Computer Science 2009-09-29 Satoshi Matsuoka

In this article an interpretation and a proof of some classical \\theorems in analysis on the integration of analytic vectors fields are derived from the algebraic method of realization of bialgebras which are constructed with the data of a…

Quantum Algebra · Mathematics 2007-05-23 Eric Mourre

Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. In particular, we argue that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ for $n \to…

Number Theory · Mathematics 2007-05-23 André Voros

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…

Logic in Computer Science · Computer Science 2024-02-26 Sara Ayhan

The so-called Fundamental Theorem of Dynamical Systems -- which(1) relates attractors and repellers to the chain recurrent set and (2) gives the existence of a complete Lyapunov function -- can be seen as a means of separating out…

Dynamical Systems · Mathematics 2025-08-15 Andrew D. Lewis

We define $\lambda(r)$-convergence, which is a generalization of nontangential convergence in the unit disc. We prove Fatou-type theorems on almost everywhere nontangential convergence of Poisson-Stiltjes integrals for general kernels…

Classical Analysis and ODEs · Mathematics 2022-11-08 G. A. Karagulyan , M. H. Safaryan

This article provides a thorough investigation into Gilbert's Conjecture, pertaining to Hardy spaces in the upper half-space valued in Clifford modules. We explore the conjecture proposed by Gilbert in 1991, which seeks to extend the…

Complex Variables · Mathematics 2024-04-05 Yong Li , Guangbin Ren

We construct a perfect version of Morel--Voevodsky's motivic homotopy category over a perfect base scheme in positive characteristic. By checking the axioms of a coefficient system, we establish a six-functor formalism. We show that…

Algebraic Geometry · Mathematics 2025-10-03 Christian Dahlhausen , Jeroen Hekking , Storm Wolters

The purpose of this paper is to develop a theory of bimonads and Hopf monads on arbitrary categories thus providing the possibility to transfer the essentials of the theory of Hopf algebras in vector spaces to more general settings. There…

Quantum Algebra · Mathematics 2008-06-11 Bachuki Mesablishvili , Robert Wisbauer

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…

Combinatorics · Mathematics 2026-05-05 Matthias Beck , Thomas Kunze

We generalize Goodstein's theorem (Goodstein 1944) and Cichon's independence proof (Cichon 1983) to $\Pi^1_1-\mathrm{CA}_0$ using results from (Wilken 2026). The method is generalizable to stronger notation systems that provide unique terms…

Logic · Mathematics 2026-05-06 Gunnar Wilken

Let $G_n$ be an inner form of a general linear group over a non-Archimedean field. We fix an arbitrary irreducible representation $\sigma$ of $G_n$. Lapid-M\'inguez give a combinatorial criteria for the irreducibility of parabolic induction…

Representation Theory · Mathematics 2024-02-16 Kei Yuen Chan

This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…

Logic in Computer Science · Computer Science 2013-10-28 Anton Salikhmetov