Related papers: An elementary proof that P =/= NP

Short nonstandard proofs are given for some results about infinite systems of equations in infinitely many variables.

A classical theorem of d'Alembert states that if a polynomial P(x) with real coefficients has a non-real root x=a+ib, then it also has a root x=a-ib. We give a short and elementary inductive proof that avoids any properties of the complex…

I present here a simple proof that, under general regularity conditions, the standard parametrization of generalized linear mixed model is identifiable. The proof is based on the assumptions of generalized linear mixed models on the first…

We show that the universally axiomatized, induction-free theory PA^- is a sequential theory in the sense of Pudl\'ak [5], in contrast to the closely related Robinson's arithmetic.

The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…

We prove a generalized version of the no-broadcasting theorem, applicable to essentially \emph{any} nonclassical finite-dimensional probabilistic model satisfying a no-signaling criterion, including ones with ``super-quantum'' correlations.…

We will give an elementary nonstandard proof that the family of generalized blancmange functions are nowhere differentiable. The proof follows from the intuitive characterization of differentiability at a point as almost $\delta$ affine…

SAT is not in P, is true and provable in a simply consistent extension B' of a first order theory B of computing, with a single finite axiom characterizing a universal Turing machine. Therefore, P is not equal to NP, is true and provable in…

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

The P versus NP problem is studied under the relational model of E. F. Codd. I found that the term "complete configuration" is unnecessary and harmful in computational complexity theory because of excessive symbol redundancy. For an input,…

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

We prove that if $p$ is an odd prime, $G$ is a solvable group, and the average value of the irreducible characters of $G$ whose degrees are not divisible by $p$ is strictly less than $2(p+1)/(p+3)$, then $G$ is $p$-nilpotent. We show that…

We propose a pedestrian review of the noncommutative standard model in its present state.

In this paper, we define the asymptotic stable division property for submodules of the Bergman module. We show that under a mild condition, a submodule with the asymptotic stable division property is p-essentially normal for all p>n. A new…

We determine sufficient structure for an elementary topos to emulate E. Nelson's Internal Set Theory in its internal language, and show that any topos satisfying the internal axiom of choice occurs as a universe of standard objects and…

The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…

We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.

We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…

We provide an elementary proof of a bicategorical pasting theorem that does not rely on Power's 2-categorical pasting theorem, the bicategorical coherence theorem, or the local characterization of a biequivalence.

In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erd\"os theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor…