相关论文: Frege's theory of types

We introduce a number field analogue of the Mertens conjecture and demonstrate its falsity for all but finitely many number fields of any given degree. We establish the existence of a logarithmic limiting distribution for the analogous…

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the lambda-models underpinning higher-order programming languages, is…

This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much…

In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…

For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…

We describe a way to represent computable functions between coinductive types as particular transducers in type theory. This generalizes earlier work on functions between streams by P. Hancock to a much richer class of coinductive types.…

Category theory is the language of homological algebra, allowing us to state broadly applicable theorems and results without needing to specify the details for every instance of analogous objects. However, authors often stray from the realm…

Although contemporary model theory has been called "algebraic geometry minus fields", the formal methods of the two fields are radically different. This dissertation aims to shrink that gap by presenting a theory of logical schemes,…

In this paper we give an algorithmic description of Freyd categories that subsumes and enhances the usual approach to finitely presented modules in computer algebra. The upshot is a constructive approach to finitely presented functors that…

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

Hierarchies of conditional beliefs (Battigalli and Siniscalchi 1999) play a central role for the epistemic analysis of solution concepts in sequential games. They are practically modelled by type structures, which allow the analyst to…

A family of partial functions of a class of algebras $\mathsf{K}$ is said to be an implicit operation of $\mathsf{K}$ when it is defined by a first order formula and it is preserved by homomorphisms. In this work, we develop the theory of…

In this paper, we study lower order terms of the $1$-level density of low-lying zeros of quadratic Hecke L-functions in the Gaussian field. Assuming the Generalized Riemann Hypothesis, our result is valid for even test functions whose…

We define an elementary $\infty$-topos that simultaneously generalizes an elementary topos and Grothendieck $\infty$-topos. We then prove it satisfies the expected topos theoretic properties, such as descent, local Cartesian closure,…

We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…

In this paper we sketch how some fundamental concepts of modern topology (as well as logic and category theory) can be understood philosophically in the light of Hegel's Science Logic as well how modern topological concepts can provide…

In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be…

Let $X$ be a scheme. In this text, we extend the known definitions of a topology on the set $X(R)$ of $R$-rational points from topological fields, local rings and ad\`ele rings to any ring $R$ with a topology. This definition is functorial…

We define various height functions for motives over number fields. We compare these height functions with classical height functions on algebraic varieties, and also with analogous height functions for variations of Hodge structures on…