English
Related papers

Related papers: Statman's Hierarchy Theorem

200 papers

We consider the Einstein equation with first order (semiclassical) quantum corrections. Although the quantum corrections contain up to fourth order derivatives of the metric, the solutions which are physically relevant satisfy a reduced…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Leonard Parker , Jonathan Z. Simon

We provide a much shorter but even more powerful proof of an algebraic identity, which can be used to establish the direct and the converse inequality under Type IV superorthogonality. As an application, we obtain the optimal order of the…

Classical Analysis and ODEs · Mathematics 2024-04-16 Yixuan Pang

This paper consists of three interconnected parts. Parts I,III study the relationship between the cohomology of a reductive group and that of a Levi subgroup. For example, we provide a necessary condition, arising from Kazhdan-Lusztig…

Group Theory · Mathematics 2007-05-23 B. Parshall , L. Scott

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Logic · Mathematics 2025-12-08 Ruiyuan Chen , David Gonzalez , Matthew Harrison-Trainor

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…

Logic in Computer Science · Computer Science 2013-04-01 Antonio Bucciarelli , Alberto Carraro , Antonino Salibra

Recent years have seen tremendous growth in the amount of verified software. Proofs for complex properties can now be achieved using higher-order theories and calculi. Complex properties lead to an ever-growing number of definitions and…

Programming Languages · Computer Science 2021-11-29 Eytan Singher , Shachar Itzhaky

Invertibility is an important concept in category theory. In higher category theory, it becomes less obvious what the correct notion of invertibility is, as extra coherence conditions can become necessary for invertible structures to have…

Category Theory · Mathematics 2020-10-20 Alex Rice

The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…

Logic in Computer Science · Computer Science 2022-03-15 Andrew M. Pitts

For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…

Programming Languages · Computer Science 2020-07-28 Pierre-Évariste Dagand , Lionel Rieg , Gabriel Scherer

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…

Logic in Computer Science · Computer Science 2011-01-25 Antonio Bucciarelli

Standard Type Theory, STT, tells us that $b^n(a^m)$ is well-formed iff $n=m+1$. However, Linnebo and Rayo (2012) have advocated for the use of Cumulative Type Theory, CTT, which has more relaxed type-restrictions: according to CTT,…

Logic · Mathematics 2021-08-11 Tim Button , Robert Trueman

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2012-08-01 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

Refining and extending previous work by Retor\'e, we develop a systematic approach to intersection types via natural deduction. We show how a step of beta reduction can be seen as performing, at the level of typing derivations, Prawitz…

Logic in Computer Science · Computer Science 2019-04-24 Federico Aschieri

We present {\lambda}ert, a type theory supporting refinement types with explicit proofs. Instead of solving refinement constraints with an SMT solver like DML and Liquid Haskell, our system requires and permits programmers to embed proofs…

Programming Languages · Computer Science 2023-11-27 Jad Elkhaleq Ghalayini , Neel Krishnaswami

Higman's lemma and Kruskal's theorem are two of the most celebrated results in the theory of well quasi-orders. In his seminal paper G. Higman obtained what is known as Higman's lemma as a corollary of a more general theorem, dubbed here…

Logic · Mathematics 2026-02-06 Gabriele Buriola , Andreas Weiermann

Injectivity of objects with respect to a set $\ch$ of morphisms is an important concept of algebra, model theory and homotopy theory. Here we study the logic of injectivity consequences of $\ch$, by which we understand morphisms $h$ such…

Category Theory · Mathematics 2007-09-18 J. Adamek , M. Hebert , L. Souza

In this work we give a characterisation of first order phase transitions as equilibrium processes on the thermodynamic phase space for which the Legendre symmetry is broken. Furthermore, we consider generalised theories of thermodynamics,…

General Physics · Physics 2013-09-26 A. Bravetti , C. S. Lopez-Monsalvo , F. Nettel

New low-order $H(\textrm{div})$-conforming finite elements for symmetric tensors are constructed in arbitrary dimension. The space of shape functions is defined by enriching the symmetric quadratic polynomial space with the $(d+1)$-order…

Numerical Analysis · Mathematics 2024-02-22 Xuehai Huang , Chao Zhang , Yaqian Zhou , Yangxing Zhu

This work is an attempt towards a Morita theory for stable equivalences between self-injective algebras. More precisely, given two self-injective algebras A and B and an equivalence between their stable categories, consider the set S of…

Representation Theory · Mathematics 2010-08-12 Jeremy Rickard , Raphael Rouquier

We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2017-05-12 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron