Related papers: Frege's theory of types
As originally proposed, type classes provide overloading and ad-hoc definition, but can still be understood (and implemented) in terms of strictly parametric calculi. This is not true of subsequent extensions of type classes. Functional…
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…
Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which…
In this paper, we study matrix functions of bounded type from the viewpoint of describing an interplay between function theory and operator theory. \ We first establish a criterion on the coprime-ness of two singular inner functions and…
Inspired by the work of Bank on the hypertranscendence of $\Gamma e^h$ where $\Gamma$ is the Euler gamma function and $h$ is an entire function, we investigate when a meromorphic function $fe^g$ cannot satisfy any algebraic differential…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
We give an algebraic characterization of the syntax and semantics of a class of simply-typed languages, such as the language PCF: we characterize simply-typed binding syntax equipped with reduction rules via a universal property, namely as…
There is a general phenomenon in algebra that numerous functors of homological significance admit characterization as derived limits of elementary functors defined over categories of free extensions. We demonstrate that upon restriction to…
Euler defines a function f(x) somehow as an infinite product and a generalization of [x], where [x] ist, what we now call following Legendre the Gamma-Funktion. He gets some recursive relationships for f(x), by applying some very nice…
Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…
We introduce the basic elements of the theory of parametrized $\infty$-categories and functors between them. These notions are defined as suitable fibrations of $\infty$-categories and functors between them. We give as many examples as we…
A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…
We introduce and study some general principles and hierarchical properties of expansions and restrictions of structures and their theories The general approach is applied to describe these properties for classes of $\omega$-categorical…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
The level two string functions are calculated exactly for all simply laced Lie algebras, using a ladder coset construction. These are the characters of cosets of the type $G/U(1)^r$, where $G$ is the algebra at level two and $r$ is its…
Traditional treatments of formal logic provide: 1. A syntax for formulas. 2. An inference relation between sets of formulas. 3. A rule for assigning meaning to formulas (semantics) that is sound with respect to the inference relation. First…
Church's thesis claims that all effecticely calculable functions are recursive. A shortcoming of the various definitions of recursive functions lies in the fact that it is not a matter of a syntactical check to find out if an entity gives…
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed…
In the first part of this paper, we develop a general framework that permits a comparison between explicit class field theories for a family of rational function fields $\mathbb{F}_s(t)$ over arbitrary constant fields $\mathbb{F}_s$ and…