相关论文: Frege's theory of types

We study the representation theory of three towers of algebras which are related to the symmetric groups and their Hecke algebras. The first one is constructed as the algebras generated simultaneously by the elementary transpositions and…

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…

We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…

Recently, the first author of this paper, used the structure of finite dimensional translation invariant subspaces of C(R,C) to give a new proof of classical Montel's theorem, about continuous solutions of Fr\'{e}chet's functional equation…

We show that the notion of zeta functions over F1, as given in special cases by Soule', extends naturally to all F1-schemes as defined earlier by the author. We further give two constructions of K-theory for affine schemes or F1-rings, we…

In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…

CFTs are naturally defined on Riemann surfaces. The rational ones can be solved using methods from algebraic geometry. One particular feature is the covariance of the partition function under the mapping class group. In genus $g=1$, this…

Motivated by the works of Liu, we provide a unified approach to find Appell-Lerch series and Hecke-type series representations for mock theta functions. We establish a number of parameterized identities with two parameters $a$ and $b$.…

While computer programs and logical theories begin by declaring the concepts of interest, be it as data types or as predicates, network computation does not allow such global declarations, and requires *concept mining* and *concept…

We define a Hopf algebra of polylogarithms of an arbitrary field, which is a candidate for a conjectural Hopf algebra of framed mixed Tate motives. Our definition is elementary and mimics Goncharov's construction of higher Bloch groups. We…

In 1995, Meinardus & Berg presented a reformulation of the Collatz Conjecture in terms of a functional equation in a single complex variable over the open unit disk. This paper generalizes that method to deal with not only a large class of…

Developing and maintaining software commonly requires (1) adding new data type constructors to existing applications, but also (2) adding new functions that work on existing data. Most programming languages have native support for defining…

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…

This work presents a contemporary treatment of Krein's entire operators with deficiency indices $(1,1)$ and de Branges' Hilbert spaces of entire functions. Each of these theories played a central role in the research of both renown…

System F, the polymorphic lambda calculus, features the principle of impredicativity: polymorphic types may be (explicitly) instantiated at other types, enabling many powerful idioms such as Church encoding and data abstraction.…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…

Some Tur\'an type inequalities for Struve functions of the first kind are deduced by using various methods developed in the case of Bessel functions of the first and second kind. New formulas, like Mittag-Leffler expansion, infinite product…

We define Hecke correspondences and Hecke operators on unitary RZ spaces and study their basic geometric properties, including a commutativity conjecture on Hecke operators. Then we formulate the Arithmetic Fundamental Lemma conjecture for…