Related papers: The excess formula in functorial form
We introduce a new real valued invariant for finitely presented groups called residual deficiency. Its main property is the following. Let G be a finitely presented group. If the residual deficiency of G is greater than one, then G has a…
The Chern classes of a K-theory class which is represented by a vector bundle with connection admit refinements to Cheeger-Simons classes in Deligne cohomology. In the present paper we consider similar refinements in the case where the…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
We characterise slice-regularity of functions over a real alternative *-algebra using operators that arise in Dunkl operator theory. We present a unifying perspective on hypercomplex analysis by defining a family of function spaces in the…
We investigate refined algebraic quantisation within a family of classically equivalent constrained Hamiltonian systems that are related to each other by rescaling a momentum-type constraint. The quantum constraint is implemented by a…
We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…
The recently introduced dependent typed higher-order logic (DHOL) offers an interesting compromise between expressiveness and automation support. It sacrifices the decidability of its type system in order to significantly extend its…
An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…
Refinement type checkers are a powerful way to reason about functional programs. For example, one can prove properties of a slow, specification implementation, porting the proofs to an optimized implementation that behaves the same. Without…
This article is part of a series of works by the authors with the goal of completing a far-reaching program propounded by Deligne, aiming to extend the codimension one part of the Grothendieck-Riemann-Roch theorem from isomorphism classes…
Let $F$ be a finitely generated regular field extension of transcendence degree $\geq 2$ over a perfect field $k$. We show that the multiplicative group $F^\times/k^\times$ endowed with the equivalence relation induced by algebraic…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
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…
In a refined Sobolev scale, we investigate an elliptic boundary-value problem with additional unknown functions in boundary conditions for which the maximum of orders of boundary operators is grater than or equal to the order of the…
We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1) relational algebra and safe database access, (2)…
Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although the termination of this algorithm is far from obvious, its equivalence to the traditional recursive…
A Feynman formula is a representation of a solution of an initial (or initial-boundary) value problem for an evolution equation (or, equivalently, a representation of the semigroup resolving the problem) by a limit of $n$-fold iterated…
The regularity of refinable functions has been studied extensively in the past. A classical result by Daubechies and Lagarias states that a compactly supported refinable function in $\R$ of finite mask with integer dilation and translations…
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
In this paper, we first introduce certain forms of extended incomplete Pochhammer symbols which are then used to define families of extended incomplete generalized hypergeometric functions. For these functions, we investigate various…