相关论文: An attempt to prove an effective Siegel theorem--P…

In this paper, we give a detailed account of Goldfeld's proof of Siegel's theorem. Particularly, we present complete proofs of the nontrivial assumptions made in his paper.

A detailed and rigorous analysis of G\"odel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what G\"odel actually proved to provide a clear and solid foundation upon…

This article aims to find explicit congruences between Dirichlet characters and gives various results on how to find some effectively on a computer. It ends with concrete examples putting those ideas in application.

Most discussions of G\"odel's theorems fall into one of two types: either they emphasize perceived philosophical, cultural "meanings" of the theorems, and perhaps sketch some of the ideas of the proofs, usually relating G\"odel's proofs to…

We survey the classical results of the Dirichlet Approximation Theorem.

In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly…

The goals of this paper are first to describe and then to apply an ergodic-theoretic generalization of the Siegel integral formula from the geometry of numbers. The general formula will be seen to serve both as a guide and as a tool for…

Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…

G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…

In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…

A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…

Unlike classical modular forms, there is currently no general way to implement the computation of Siegel modular forms of arbitrary weight, level and character, even in degree two. There is however, a way to do it in a unified way. After…

We study the problem of determining elements of the Selberg class by information on the coefficents of the Dirichlet series at the squares of primes, or information about the zeroes of the functions.

To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…

In this note we investigate the problem of determining elements of the Selberg class from their Dirichlet series coefficients at the primes. We show that this is possible when the degree is one, but in general need an additional weak…

A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)

We give a survey of current research on G\"{o}del's incompleteness theorems from the following three aspects: classifications of different proofs of G\"{o}del's incompleteness theorems, the limit of the applicability of G\"{o}del's first…

This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.

I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…

We provide sharp new estimates for distance function in a Siegel domain of first and of second type