Related papers: Proof-theoretic dilator and intermediate pointclas…
Tilting theory has been a very important tool in the classification of finite dimensional algebras of finite and tame representation type, as well as, in many other branches of mathematics. Happel [Ha] proved that generalized tilting…
Recent developments in the construction of generalized Dirac duals have revealed, within the structure of the Clifford algebra $\mathbb{C}\otimes\mathcal{C}\ell_{1,3},$ the existence of distinct algebraic formulations of spinors duals with…
The generality of a derivation is an equivalence relation on the set of occurrences of variables in its premises and conclusion such that two occurrences of the same variable are in this relation iff they must remain occurrences of the same…
We present a streamlined account of a recent theorem on the classification of the $L$-functions of degree 2 and conductor 1 from the extended Selberg class. We also present a more general new result dealing with functional equations…
Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus. More recently, a…
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program…
Addition theorems have been indispensable tools for the reduction of quantum transition amplitudes. They are normally utilized at the start of the process to move the angular dependence within plane waves and Coulomb potentials, and the…
Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…
These lecture notes introduce central notions of impredicative ordinal analysis, such as the Bachmann-Howard ordinal and the method of collapsing, which transforms uncountable proof trees into countable ones. Specifically, we analyze…
We study a generalization of Serre--Tate theory of ordinary abelian varieties and their deformation spaces. This generalization deals with abelian varieties equipped with additional structures. The additional structures can be not only an…
Grothendieck fibrations are fundamental in capturing the concept of dependency, notably in categorical semantics of type theory and programming languages. A relevant instance are Dialectica fibrations which generalise G\"odel's Dialectica…
A classical tool in the study of real closed fields are the fields $K((G))$ of generalized power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…
Ordinal data analysis is an interesting direction in machine learning. It mainly deals with data for which only the relationships `$<$', `$=$', `$>$' between pairs of points are known. We do an attempt of formalizing structures behind…
The relationship between spinors and Clifford (or geometric) algebra has long been studied, but little consistency may be found between the various approaches. However, when spinors are defined to be elements of the even subalgebra of some…
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.
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…
We use Koll\'ar's gluing theory to prove the contraction theorem for generalized pairs. In particular, we show that we can run the MMP for any generalized log canonical pairs.
We display the entire structure ${\cal R}_2$ coding $\Sigma_1$- and $\Sigma_2$-elementarity on the ordinals. This will enable the analysis of pure $\Sigma_3$-elementary substructures.
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…