相关论文: Note on the ABC Conjecture
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
The systematic biases seen in people's probability judgments are typically taken as evidence that people do not reason about probability using the rules of probability theory, but instead use heuristics which sometimes yield reasonable…
This note shows that the three theorems presented in J. Math. Anal. Appl. 556 (2026), 130199, whose proofs, in their present formulation, are purely formal, follow from elementary calculus.
These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…
This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…
We show that subpresentations of aspherical prounipotent presentations over fields of zero characteristics and subpresentations of aspherical pro-$p$-presentations are aspherical, an application to subpresentations of aspherical discrete…
These lecture notes give an introduction to the Brauer-Manin obstruction to the existence of rational points, focusing on the interplay between theory and computation.
Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
We prove that the $abc$-Conjecture implies upper bounds on Zsigmondy sets that are uniform over families of unicritical polynomials over number fields. As an application, we use the $abc$-Conjecture to prove that there exist uniform bounds…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…
We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…
In this short note we present some remarks and conjectures on two of Erd\"os's open problems in number theory.
We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c <…
Enrico Bombieri proved that the ABC Conjecture implies Roth's theorem in 1994. This paper concerns the other direction. In making use of Bombieri's and Van der Poorten's explicit formula for the coefficients of the regular continued…
We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.
Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises. Starting from hypothetical thoughts, we are interested which are the implications behind basic everyday language and how do we…
Analogy has received attention as a form of inductive reasoning in the empirical sciences. However, its role in pure mathematics has received less consideration. This paper provides an account of how an analogy with a more familiar…
We propose a subconjecture that implies the semiampleness conjecture for quasi-numerically positive log canonical divisors and prove the semiampleness in some elementary cases.