Related papers: Frege's theory of types
Frege's definition of the real numbers, as envisaged in the second volume of \textit{Grundgesetze der Arithmetik}, is fatally flawed by the inconsistency of Frege's ill-fated \textit{Basic Law V}. We restate Frege's definition in a…
In this paper, I revisit Frege's theory of sense and reference in the constructive setting of the meaning explanations of type theory, extending and sharpening a program--value analysis of sense and reference proposed by Martin-L\"of…
Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
In 1837, Dirichlet proved that there are infinitely many primes in any arithmetic progression in which the terms do not all share a common factor. Modern presentations of the proof are explicitly higher-order, in that they involve…
The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a…
In his 1879 paper on the Begriffsschrift, Gottlob Frege introduced a notation to formalize mathematical arguments. In this note we explain Frege's notation by using the nowadays common notions from elementary propositional logic. We compare…
We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…
Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension…
The class of type-two basic feasible functionals ($\mathtt{BFF}_2$) is the analogue of $\mathtt{FP}$ (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments.…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…
For every $q\in(0,1)$ and $0\le \alpha<1$ we define a class of analytic functions, the so-called $q$-starlike functions of order $\alpha$, on the open unit disk. We study this class of functions and explore some inclusion properties with…
We first investigate two kinds of Fricke families consisting of Fricke functions and Siegel functions, respectively. And, in terms of their special values we generate ray class fields of imaginary quadratic fields, which is related to the…
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) -> Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer…
We extend some recent work of D. McCarthy, proving relations among some Fourier coefficients of a degree 2 Siegel modular form $F$ with arbitrary level and character, provided there are some primes $q$ so that $F$ is an eigenform for the…
We introduce the primitivity of Fricke families, and give some examples. As its application, we first construct generators of the function field of the modular curve of level $N$ in terms of Fricke functions and Siegel functions,…
A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be non-interleaved and stratified, i.e., the types are assigned levels, and a…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
The question in the title is ambiguous. At least the understanding of words essentially different and function theory should be clarified. We discuss approaches to do that. We also present a new framework for analytic function theories…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…