Related papers: Frege's theory of types
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
Incremental computations attempt to exploit input similarities over time, reusing work that is unaffected by input changes. To maximize this reuse in a general-purpose programming setting, programmers need a mechanism to identify dynamic…
The cohomology theory TMF of topological modular forms is a derived algebro-geometric interpretation of the classical ring of complex modular forms from number theory. In this article, we refine the classical Adams operations, Hecke…
This is the first of four papers prompted by a recent literature about a doctrine dubbed spacetime functionalism. This paper gives our general framework for discussing functionalism. Following Lewis, we take it as a species of reduction. We…
Ever since the introduction of motivic homotopy theory, as a well-proposed approximation of Grothendieck's dream, algebraic geometers then have the chance to study schemes via a homotopy theory. However topologists also found that lifting…
This monograph elucidates and extends many theorems and conjectures in analytic number theory and algebraic asymptotic analysis via the natural notion of "degree" and a more general notion that we call "logexponential degree." Specifically,…
The so called quantized algebras of functions on affine Hecke algebras of type A and the corresponding q-Schur algebras are defined and their irreducible unitarizable representations are classified.
We study various characterizations of higher sites over a given $\infty$-category $\mathcal{C}$ which are conceptually in line with their classical ordinary categorical counterparts, and extract some new results about $\infty$-topos theory…
This paper presents an approach to Prolog-style term encoding of typed feature structures. The type feature structures to be encoded are constrained by appropriateness conditions as in Carpenter's ALE system. But unlike ALE, we impose a…
Fragments of first-order logic over words can often be characterized in terms of finite monoids or finite semigroups. Usually these algebraic descriptions yield decidability of the question whether a given regular language is definable in a…
Cartwright-type and Bernstein-type theorems, previously known only for functions of exponential type in $\C^n$, are extended to the case of functions of arbitrary order in a cone.
First we define a unification grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this…
Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…
In the past several subclasses of starlike functions are defined involving real part and modulus of certain expressions of functions under study, combined by way of an inequality. In the similar fashion, we introduce a new class…
We construct two functorial filtrations on the algebraic $K$-theory of schemes of finite type over a field $k$ that may admit arbitrary singularities and may be non-reduced, one called the coniveau filtration, and the other called the…
We show that bounded type implies finite type for a constructible subcategory of the module category of a finitely generated algebra over a field, which is a variant of the first Brauer-Thrall conjecture. A full subcategory is constructible…
Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to…
We say that a function f defined on R or Qp has a well defined weak Mellin transform (or weak zeta integral) if there exists some function $M\_f(s)$ so that we have $Mell(\phi \star f,s) = Mell(\phi,s)M\_f(s)$ for all test functions $\phi$…