Related papers: Proof-theoretic dilator and intermediate pointclas…
Szpilrajn's Lemma entails that each partial order extends to a linear order. Dushnik and Miller use Szpilrajn's Lemma to show that each partial order has a relizer. Since then, many authors utilize Szpilrajn's Theorem and the Well-ordering…
We investigate an alternative to the DGLAP evolution of structure functions through the use of Fixed Order Perturbation Theory. Remarkable agreement between the two methods are found in the polarized sector for a wide $x$, $Q^2$ region.…
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
We study various corrections of correlation functions to leading order in conformal perturbation theory, both on the cylinder and on the plane. Many problems on the cylinder are mathematically equivalent to those in the plane if we give the…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…
Normal and composition series of modules enumerated by ordinal numbers are studied. The Jordan-Holder theorem for them is discussed.
Classical spectral theory provides powerful tools for analyzing linear operators, but does not extend naturally to nonlinear or compositional settings. In particular, there is no general way to transport spectral invariants in a functorial…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
We study sigma-ideals and regularity properties related to the "filter-Laver" and "dual-filter-Laver" forcing partial orders. An important innovation which enables this study is a dichotomy theorem proved recently by Miller [1]. [1] Arnold…
We establish a finite-dimensional version of the Arveson-Stinespring dilation theorem for unital completely positive maps on operator systems. This result can be seen as a general principle to deduce finite-dimensional dilation theorems…
Inductive theorem provers often diverge. This paper describes a simple critic, a computer program which monitors the construction of inductive proofs attempting to identify diverging proof attempts. Divergence is recognized by means of a…
Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…
We improve and generalize in several accounts the recent rigorous proof of convergence of delta expansion - order dependent mappings (variational perturbation expansion) for the energy eigenvalues of anharmonic oscillator. For the…
We develop some aspects of the theory of derivators, pointed derivators, and stable derivators. As a main result, we show that the values of a stable derivator can be canonically endowed with the structure of a triangulated category.…
We study the existence of optimal and p-optimal proof systems for classes in the Boolean hierarchy over $\mathrm{NP}$. Our main results concern $\mathrm{DP}$, i.e., the second level of this hierarchy: If all sets in $\mathrm{DP}$ have…
Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
Some basic features of the simultaneous inclusion of discrete fibrations and discrete opfibrations on a category A in the category of categories over A are studied; in particular, the reflections and the coreflections of the latter in the…
Assuming the Generalized Riemann Hypothesis, we provide uniform upper and lower bounds with explicit main terms for $\log{\left|\cL(s)\right|}$ for $\sigma \in (1/2,1)$ and for functions in the Selberg class. In particular, we focus on the…