Related papers: Frege's theory of types
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
In type theories, universe hierarchies are commonly used to increase the expressive power of the theory while avoiding inconsistencies arising from size issues. There are numerous ways to specify universe hierarchies, and theories may…
Using the Ratios Conjecture, we write down precise formulas with lower order terms for the one and the two level densities of zeros of quadratic Dirichlet $L$--functions over function fields. We denote the various terms arising as Type-$0$,…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
In dependent type theory, being able to refer to a type universe as a term itself increases its expressive power, but requires mechanisms in place to prevent Girard's paradox from introducing logical inconsistency in the presence of…
1. This paper shows how the universals of category theory in mathematics provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in…
Feferman (1975) defines an impredicative system $\mathsf{T}_0$ of explicit mathematics, which is proof-theoretically equivalent to the subsystem $\Delta^1_2$-$\mathsf{CA} + \mathsf{BI}$ of second-order arithmetic. In this paper, we propose…
Formal (mixed) Hodge structures FHS are introduced in such a way that the Hodge realization of Deligne's 1-motives extends to a realization from Laumon's 1-motives to formal Hodge structures of level 1, providing an equivalence of…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
A certain class of matrix-valued Borel matrix functions is introduced and it is shown that all functions of that class naturally operate on any operator T in a finite type I von Neumann algebra M in a way such that uniformly bounded…
The role of types in categorical models of meaning is investigated. A general scheme for how typed models of meaning may be used to compare sentences, regardless of their grammatical structure is described, and a toy example is used as an…
There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to…
The purpose of this article is threefold: Firstly, we propose some enhancements to the existing definition of 6-functor formalisms. Secondly, we systematically study the category of kernels, which is a certain 2-category attached to every…
The representation of mathematical objects in terms of (more) basic ones is part and parcel of (the foundations of) mathematics. In the usual foundations of mathematics, i.e. $\textsf{ZFC}$ set theory, all mathematical objects are…
${\rm CTT}_{\rm qe}$ is a version of Church's type theory with global quotation and evaluation operators that is engineered to reason about the interplay of syntax and semantics and to formalize syntax-based mathematical algorithms. ${\rm…
A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…
The contribution of this article is a data concept that is essentially based on the two concepts of information and computable functionality. In short, data is viewed as typed information. A data type is defined as a pair of a set of…
We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to…