Related papers: The Goebbellian Syndrome
Did we really hope to get away with The Goedelian Argument? A critical response to J. R. Lucas' 1996 articulation of his 1961 argument.
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
Type two cuts, bad cuts and very bad cuts are introduced by Keisler and Leth for studying the relationship between Loeb measure and U-topology of a hyperfinite time line in an $\omega_1$-saturated nonstandard universe. The questions…
Fix a countable nonstandard model $\mathcal M$ of Peano Arithmetic. Even with some rather severe restrictions placed on the types of minimal cofinal extensions $\mathcal N \succ \mathcal M$ that are allowed, we still find that there are…
Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…
According to Chaitin, G\"odel once told him "it doesn't matter which paradox you use [to prove the First Incompleteness Theorem]". In this paper I will present a few infinitary paradoxes and show how to "translate" them to some undecidable…
Recently, Artemov [4] offered the notion of constructive consistency for Peano Arithmetic and generalized it to constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs.…
We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.
We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…
The impressive performance of recent language models across a wide range of tasks suggests that they possess a degree of abstract reasoning skills. Are these skills general and transferable, or specialized to specific tasks seen during…
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
This is an exposition of facts about Arithmetic with an approach via mathematical logic. In Section 1 we present Peano Arithmetic, PA, and the complete theory of $\mathbb{N}$, and we show that $\mathbb{N}$ is a prime model of the theory of…
It is shown here that Suarez [Found. Phys. 38, 583 (2008)] wrongly presents the assumptions behind the Leggett's inequalities, and their modified form used by Groeblacher et al. [Nature 446, 871 (2007)] for an experimental falsification of…
Here we argue that the notion of falsifiability, a key concept in defining a valid scientific theory, can be quantified using Bayesian Model Selection, which is a standard tool in modern statistics. This relates falsifiability to the…
While P-values are widely abused, they are a useful tool for many purposes; banning them is analogous to banning scalpels because most people do not know how to perform surgery. Many reported P-values are not genuine P-values, for a variety…
This is a non-standard paper, containing some problems, mainly in model theory, which I have, in various degrees, been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me,…
We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…