Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective (...) Bayesianism or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

intro to Part 1 - -/- Most people disliked mathematics when they were at school and they were absolutely correct to do so. This is because maths as we know it is severely incomplete. No matter how elaborated and complicated mathematical equations become, in today's world they're based on 1+1=2. This certainly conforms to the world our physical senses perceive and to the world scientific instruments detect. It has been of immeasurable value to all knowledge throughout history and has (...) elevated science to the lofty status it enjoys. Science is now striving towards Unification - where the subatomic realm, all matter, energy, forces, space and time will be seen as entangled parts of one universe. While 1+1=2 has been vital in getting humanity to this point, it's time to suppress our attachments to the past and realize that whereas 1+1 will always equal 2, it's also capable of equalling the 1 which represents unification. -/- intro to Part 2 -/- b) Division by zero is accepted, in Newtonian maths, to be impossible. But we can regard division by zero as division by nothing i.e. division that has no effect. In this case, 1 divided by 0 is 1. However, to a physicist there is no such thing as nothing (even empty space contains energy). What could the something called 0 actually be? It could be a binary digit. If we use the base of ten (for simplicity) and attach one and zero to it as exponents, we get 10^1 divided by 10^0 = 10^1. If we then cancel 10 from each factor in the expression, we get 1 divided by 0 = 1. At the start of the paragraph, this was referred to as division by nothing. Then 0 was called a binary digit and division by nothing became division by something. The 1 that the division equals is the unified field of space-time. Division by 0 is impossible in Newtonian maths because the result can be infinity. But the word “infinity” can, as the last section of this book shows, apply to the unified field of spacetime. So division by zero is not impossible because it results in the universe, which is obviously possible … a possibility that has always been, and always will be, realized. -/- intro to Part 3 -/- If quantum entanglement has existed in the entire universe forever, everything would be everywhere and everywhen. Space, time and 5th-dimensional hyperspace would not be restricted to certain parts of the Mobius Universe but would exist in every particle. Past, present and future would not exist as the distinct periods which everyday life assumes. All instants of all periods would exist eternally, permitting time travel to any point in the past and to any point in the future. Entanglement may be created by simply zipping along at close to the speed of light - “Quantum entanglement of moving bodies” by Robert M. Gingrich and Christoph Adami in Physical Review Letters 89, 270402 (issue of 30 December 2002) – which might be achieved, according to this book, by warping space so it’s either a fraction of the 90 degrees allowing instantaneous travel or almost at 270 degrees to space as we know it. (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as the Riemann hypothesis, have had to be considered in terms of the evidence for and against them. In recent decades, massive increases in computer power have permitted the gathering of huge amounts of numerical evidence, both for conjectures (...) in pure mathematics and for the behavior of complex applied mathematical models and statistical algorithms. Mathematics has therefore become (among other things) an experimental science (though that has not diminished the importance of proof in the traditional style). We examine how the evaluation of evidence for conjectures works in mathematical practice. We explain the (objective) Bayesian view of probability, which gives a theoretical framework for unifying evidence evaluation in science and law as well as in mathematics. Numerical evidence in mathematics is related to the problem of induction; the occurrence of straightforward inductive reasoning in the purely logical material of pure mathematics casts light on the nature of induction as well as of mathematical reasoning. (shrink)

K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory (...) although their properties can be time-dependent (when they depend on K) or informal. The true statement "K is non-empty" is outside K forever because K is not a formal set. Paul Cohen proved in 1963 that the equality 2^{\aleph_0}=\aleph_1 is independent of ZFC. Before 1963, the statement "There is a known constructively defined integer n⩾1 such that 2^{\aleph_0}=\aleph_n" was outside K. Since 1963, this statement is outside K forever. The true statement "There exists a set X⊆{1,...,49} such that card(X)=6 and X never occurred as the winning six numbers in the Polish Lotto lottery" refers to the current non-mathematical knowledge and is outside K forever. In Martin-Löf's terminology, every currently known theorem is actually true whereas every theorem (known or unknown) is potentially true. Actual truth is knowledge dependent and tensed. Potential truth is knowledge independent and tenseless. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivially true statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. For every such statement, its truth concerning the current mathematical knowledge is implied by a true statement of the form: (the conjunction of i conditions of the form α∈K)∧(the conjunction of j conditions of the form β∉K)∧(the conjunction of k conditions of the form γ∈K_c)∧(the conjunction of l conditions of the form δ∉K_c), where i,j,k,l∈N and α,β,γ,δ are mathematical statements. In constructive mathematics and the traditional Brouwerian intuitionism, the truth of a mathematical statement means that we know a constructive proof. Therefore, the truth of a mathematical statement depends on time, where the statement is formally stated in the classical mathematics without the predicate K. In this article, mathematical statements on decidable sets X⊆N refer to time because they refer to the current mathematical knowledge on X. They cannot be formally stated in the classical mathematics without the predicate K and their logical values may change in time. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(X)=ω" is outside K. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove the assumption of the above statement. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. We prove that there exists a naturally defined set C⊆N which satisfies the following conditions (6)-(11). (6) A known and simple algorithm for every k∈N decides whether or not k∈C. (7) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(C)=ω" is outside K. (8) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(N\C)=ω" is outside K. (9) It is conjectured, though so far unproven, that C is infinite. (10) For every known algorithm A with no input, the statement "A returns an integer n satisfying card(C)<ω ⇒ C⊆(-∞,n]" is outside K. (11) For every known algorithm A with no input, the statement "A returns an integer m satisfying card(N\C)<ω ⇒ N\C⊆(-∞,m]" is outside K. The set C={k∈N: 2^{2^k}+1 is composite} is naturally defined and satisfies conditions (6)-(11). (shrink)

Determinism is established in quantum mechanics by tracing the probabilities in the Born rules back to the absolute (overall) phase constants of the wave functions and recognizing these phase constants as pseudorandom numbers. The reduction process (collapse) is independent of measurement. It occurs when two wavepackets overlap in ordinary space and satisfy a certain criterion, which depends on the phase constants of both wavepackets. Reduction means contraction of the wavepackets to the place of overlap. The measurement apparatus fans out the (...) incoming wavepacket into spatially separated eigenpackets of the chosen observable. When one of these eigenpackets together with a wavepacket located in the apparatus satisfy the criterion, the reduction associates the place of contraction with an eigenvalue of the observable. The theory is nonlocal and contextual. Keywords:. (shrink)

The paper continues the consideration of Hilbert mathematics to mathematics itself as an additional “dimension” allowing for the most difficult and fundamental problems to be attacked in a new general and universal way shareable between all of them. That dimension consists in the parameter of the “distance between finiteness and infinity”, particularly able to interpret standard mathematics as a particular case, the basis of which are arithmetic, set theory and propositional logic: that is as a special “flat” case of Hilbert (...) mathematics. The following four essential problems are considered for the idea to be elucidated: Fermat’s last theorem proved by Andrew Wiles; Poincaré’s conjecture proved by Grigori Perelman and the only resolved from the seven Millennium problems offered by the Clay Mathematics Institute (CMI); the four-color theorem proved “machine-likely” by enumerating all cases and the crucial software assistance; the Yang-Mills existence and mass gap problem also suggested by CMI and yet unresolved. They are intentionally chosen to belong to quite different mathematical areas (number theory, topology, mathematical physics) just to demonstrate the power of the approach able to unite and even unify them from the viewpoint of Hilbert mathematics. Also, specific ideas relevant to each of them are considered. Fermat’s last theorem is shown as a Gödel insoluble statement by means of Yablo’s paradox. Thus, Wiles’s proof as a corollary from the modularity theorem and thus needing both arithmetic and set theory involves necessarily an inverse Grothendieck universe. On the contrary, its proof in “Fermat arithmetic” introduced by “epoché to infinity” (following the pattern of Husserl’s original “epoché to reality”) can be suggested by Hilbert arithmetic relevant to Hilbert mathematics, the mediation of which can be removed in the final analysis as a “Wittgenstein ladder”. Poincaré’s conjecture can be reinterpreted physically by Minkowski space and thus reduced to the “nonstandard homeomorphism” of a bit of information mathematically. Perelman’s proof can be accordingly reinterpreted. However, it is valid in Gödel (or Gödelian) mathematics, but not in Hilbert mathematics in general, where the question of whether it holds remains open. The four-color theorem can be also deduced from the nonstandard homeomorphism at issue, but the available proof by enumerating a finite set of all possible cases is more general and relevant to Hilbert mathematics as well, therefore being an indirect argument in favor of the validity of Poincaré’s conjecture in Hilbert mathematics. The Yang-Mills existence and mass gap problem furthermore suggests the most general viewpoint to the relation of Hilbert and Gödel mathematics justifying the qubit Hilbert space as the dual counterpart of Hilbert arithmetic in a narrow sense, in turn being inferable from Hilbert arithmetic in a wide sense. The conjecture that many if not almost all great problems in contemporary mathematics rely on (or at least relate to) the Gödel incompleteness is suggested. It implies that Hilbert mathematics is the natural medium for their discussion or eventual solutions. (shrink)

Monsters lurk within mathematical as well as literary haunts. I propose to trace some pathways between these two monstrous habitats. I start from Jeffrey Jerome Cohen’s influential account of monster culture and explore how well mathematical monsters fit each of his seven theses. The mathematical monsters I discuss are drawn primarily from three distinct but overlapping domains. Firstly, late nineteenth-century mathematicians made numerous unsettling discoveries that threatened their understanding of their own discipline and challenged their intuitions. The (...) great French mathematician Henri Poincaré characterised these anomalies as ‘monsters’, a name that stuck. Secondly, the twentieth-century philosopher Imre Lakatos composed a seminal work on the nature of mathematical proof, in which monsters play a conspicuous role. Lakatos coined such terms as ‘monster-barring’ and ‘monster-adjusting’ to describe strategies for dealing with entities whose properties seem to falsify a conjecture. Thirdly, and most recently, mathematicians dubbed the largest of the sporadic groups ‘the Monster’, because of its vast size and uncanny properties, and because its existence was suspected long before it could be confirmed. (shrink)

Let G be an additive subgroup of ℂ, let Wn = {xi = 1, xi + xj = xk: i, j, k ∈ {1, …, n }}, and define En = {xi = 1, xi + xj = xk, xi · xj = xk: i, j, k ∈ {1, …, n }}. We discuss two conjectures. If a system S ⊆ En is consistent over ℝ, then S has a real solution which consists of numbers whose absolute values belong (...) to [0, 22n –2]. If a system S ⊆ Wn is consistent over G, then S has a solution ∈ n in which |xj| ≤ 2n –1 for each j. (shrink)

How were reliable predictions made before Pascal and Fermat's discovery of the mathematics of probability in 1654? What methods in law, science, commerce, philosophy, and logic helped us to get at the truth in cases where certainty was not attainable? The book examines how judges, witch inquisitors, and juries evaluated evidence; how scientists weighed reasons for and against scientific theories; and how merchants counted shipwrecks to determine insurance rates. Also included are the problem of induction before Hume, design arguments for (...) the existence of God, and theories on how to evaluate scientific and historical hypotheses. It is explained how Pascal and Fermat's work on chance arose out of legal thought on aleatory contracts. The book interprets pre-Pascalian unquantified probability in a generally objective Bayesian or logical probabilist sense. (shrink)

Mathematical thinking skills are very important in mathematics, both to learn math or as learning goals. Thinking skills can be seen from the description given answers in solving mathematical problems faced. Mathematical thinking skills can be seen from the types, levels, and process. Proportionally questions given to students at universities in Indonesia (semester I, III, V, and VII). These questions are a matter of description that belong to the higher-level thinking. Students choose 5 of 8 given problem. (...) Qualitatively, the answers were analyzed by descriptive to see the tendency to think mathematically used in completing the test. The results show that students tend to choose the issues relating to the calculation. They are more use cases, examples and not an example, to evaluate the conjecture and prove to belong to the numeric argumentation. Used mathematical thinking students are very personal (intelligence, interest, and experience), and the situation (problems encountered). Thus, the level of half of the students are not guaranteed and shows the level of mathematical thinking. (shrink)

Disagreements that resist rational resolution, often termed “deep disagreements”, have been the focus of much work in epistemology and informal logic. In this paper, I argue that they also deserve the attention of philosophers of mathematics. I link the question of whether there can be deep disagreements in mathematics to a more familiar debate over whether there can be revolutions in mathematics. I propose an affirmative answer to both questions, using the controversy over Shinichi Mochizuki’s work on the abc conjecture (...) as a potential example of both phenomena. I conclude by investigating the prospects for the resolution of mathematical deep disagreements in virtue-theoretic approaches to informal logic and mathematical practice. (shrink)

A review of Geoffrey Marnell, Mathematical Doodlings: Curiosities, conjectures, and challenges.

I introduce a formalization of probability which takes the concept of 'evidence' as primitive. In parallel to the intuitionistic conception of truth, in which 'proof' is primitive and an assertion A is judged to be true just in case there is a proof witnessing it, here 'evidence' is primitive and A is judged to be probable just in case there is evidence supporting it. I formalize this outlook by representing propositions as types in Martin-Lof type theory (MLTT) and defining a (...) 'probability type' on top of the existing machinery of MLTT, whose inhabitants represent pieces of evidence in favor of a proposition. One upshot of this approach is the potential for a mathematical formalism which treats 'conjectures' as mathematical objects in their own right. Other intuitive properties of evidence occur as theorems in this formalism. (shrink)

In mathematics, the deductive method reigns. Without proof, a claim remains unsolved, a mere conjecture, not something that can be simply assumed; when a proof is found, the problem is solved, it turns into a “result,” something that can be relied on. So mathematicians think. But is there more to mathematical justification than proof? -/- The answer is an emphatic yes, as I explain in this article. I argue that non-deductive justification is in fact pervasive in mathematics, and that (...) it is in good epistemic standing. (shrink)

The nature of time is variously understood and varied expressions of time available are critically discussed. The nature of time formation, its structure and textures are presented taking examples from natural sciences and Indian spirituality. The physics and mathematics used to evolve the concept of time are chronologically presented. The mathematical allusion and physical illusion associated with the concept of theories of relativity are analyzed. The mathematical conjectures responsible for evolution of theories of relativity are pronounced. The (...) missing physical reality in theories of relativity in relation to appearance of contraction of length and dilation of time is given comparing these mathematical illusions associated; with the optical illusion of appearance of a scale as bent in water in a beaker to stress the point of illusion - mental and physical respectively. The physical and mathematical nature of time, its measurement and passage and the complex mathematical nature of physical and psychological times are presented. (shrink)

Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...) overcome. We introduce the concept of purity for theories of arithmetic: a theory of arithmetic is pure when it only proves arithmetical truths. Then, we argue that, under Isaacson’s thesis, some PA-provable truths—including transfinite induction claims for infinite ordinals and some consistency statements—are seemingly not arithmetical in Isaacson’s sense, and hence that Isaacson’s thesis might entail the impurity of PA. Nonetheless, we conjecture that the advocate of Isaacson’s thesis can avoid this undesirable consequence: the arithmetical nature, as understood by Isaacson, of all contentious PA-provable statements can be justified. As a case study, we explore how this is done for transfinite induction claims with infinite ordinals below ε0. To this end, we show that the PA-proof of such claims employs exclusively resources from finite mathematics, and that ordinals below ε0 are finitary objects despite being infinite. (shrink)

Special issue in honour of Landon Rabern. This special issue of Discrete Mathematics is dedicated to his memory, as a tribute to his many research achievements. It contains 10 new articles written by his collaborators, friends, and colleagues that showcase his interests.

The attempts of theoretically solving the famous puzzle-dictum of physicist Eugene Wigner regarding the “unreasonable” effectiveness of mathematics as a problem of analytical philosophy, started at the end of the 19th century, are yet far from coming out with an acceptable theoretical solution. The theories developed for explaining the empirical “miracle” of applied mathematics vary in nature, foundation and solution, from denying the existence of a genuine problem to structural theories with an advanced level of mathematical formalism. Despite this (...) variation, methodologically fundamental questions like “Which is the adequate theoretical framework for solving Wigner’s conjecture?” and “Can the logico-mathematical formalism solve it and is it entitled to do it?” did not receive answers yet. The problem of the applicability of mathematics in the physical reality has been treated unitarily in some sense, with respect to the semantic-conceptual use of the constitutive terms, within both the structural and non-structural theories. This unity (of consistency) applied to both the referred objects and concepts per se and the aims of the investigations. For being able to make an objective study of the possible alternatives of the existent theories, a foundational approach of them is needed, including through semantic-conceptual distinctions which to weaken the unity of consistency. (shrink)

A homeomorphism is built between the separable complex Hilbert space (quantum mechanics) and Minkowski space (special relativity) by meditation of quantum information (i.e. qubit by qubit). That homeomorphism can be interpreted physically as the invariance to a reference frame within a system and its unambiguous counterpart out of the system. The same idea can be applied to Poincaré’s conjecture (proved by G. Perelman) hinting at another way for proving it, more concise and meaningful physically. Furthermore, the conjecture can be generalized (...) and interpreted in relation to the pseudo-Riemannian space of general relativity therefore allowing for both mathematical and philosophical interpretations of the force of gravitation due to the mismatch of choice and ordering and resulting into the “curving of information” (e.g. entanglement). Mathematically, that homeomorphism means the invariance to choice, the axiom of choice, well-ordering, and well-ordering “theorem” (or “principle”) and can be defined generally as “information invariance”. Philosophically, the same homeomorphism implies transcendentalism once the philosophical category of the totality is defined formally. The fundamental concepts of “choice”, “ordering” and “information” unify physics, mathematics, and philosophy and should be related to their shared foundations. (shrink)

In 1980 F. Wattenberg constructed the Dedekind completion

d of the Robinson non-archimedean field

and established basic algebraic properties of

d [6]. In 1985 H. Gonshor established further fundamental properties of

d [7].In [4] important construction of summation of countable sequence of Wattenberg numbers was proposed and corresponding basic properties of such summation were considered. In this paper the important applications of the Dedekind completion

d in transcendental number theory were considered. We dealing using set theory ZFC
(
-model of ZFC).Given (...) an class of analytic functions of one complex variable f  

z, we investigate the arithmetic nature of the values of fz at transcendental points en, n  .Main results are: (i) the both numbers e
 and e   are irrational, (ii) number ee is transcendental. Nontrivial generalization of the Lindemann- Weierstrass theorem is obtained. (shrink)

In the search of new approaches to the problem of emergence and evolution of natural languages, Mathematics, Theoretical Computer Science, as well as Molecular Biology and Neuroscience, both deeply penetrated and profoundly inspired by concepts originated in Mathematics and Computer Science, represent today the richest pools of formal concepts, structures, and methods to borrow and to adapt.

It is widely agreed that the intelligibility of modal metaphysics has been vindicated. Quine's arguments to the contrary supposedly confused analyticity with metaphysical necessity, and rigid with non-rigid designators.2 But even if modal metaphysics is intelligible, it could be misconceived. It could be that metaphysical necessity is not absolute necessity – the strictest real notion of necessity – and that no proposition of traditional metaphysical interest is necessary in every real sense. If there were nothing otherwise “uniquely metaphysically significant” about (...) metaphysical necessity, then paradigmatic metaphysical necessities would be necessary in one sense of “necessary”, not necessary in another, and that would be it. The question of whether they were necessary simpliciter would be like the question of whether the Parallel Postulate is true simpliciter – understood as a pure mathematical conjecture, rather than as a hypothesis about physical spacetime. In a sense, the latter question has no objective answer. In this article, I argue that paradigmatic questions of modal metaphysics are like the Parallel Postulate question. I then discuss the deflationary ramifications of this argument. I conclude with an alternative conception of the space of possibility. According to this conception, there is no objective boundary between possibility and impossibility. Along the way, I sketch an analogy between modal metaphysics and set theory. (shrink)

I prove both the mathematical conjectures P ≠ NP and the Continuum Hypothesis are eternally unprovable using the same fundamental idea. Starting with the Saunders Maclane idea that a proof is eternal or it is not a proof, I use the indeterminacy of human biological capabilities in the eternal future to show that since both conjectures are independent of Axioms and have definitions connected with human biological capabilities, it would be impossible to prove them eternally without the (...) creation and widespread acceptance of new axioms. I also show that the same fundamental concepts cannot be used to demonstrate the eternal unprovability of many other mathematical theorems and open conjectures. Finally I investigate the idea’s implications for the foundations of mathematics including its relation to Godel’s Incompleteness Theorem and Tarsky’s Undefinability Theorem. (shrink)

This paper concerns Wittgenstein’s conception of philosophical and mathematical problems. Both in his earlier and in his later writings Wittgenstein grapples with the tendency of philosophers to misconstrue the nature of the difficulties that they are facing. Whereas philosophers tend to assume that their problems are comparable to those that come up in the sciences, and take these problems to consist in questions the answers to which will provide them with substantive knowledge, Wittgenstein compares philosophical problems with riddles. What (...) is characteristic of riddles is that solving them involves an alteration of the use of language, but it does not tend to involve the acquisition of new knowledge. In his middle and later period, the comparison with riddles serves to highlight and resolve a related confusion in the way philosophers of mathematics understand the nature of mathematical problems. Wittgenstein rejects the realist approach according to which every mathematical theorem, whether proven or not, meaningfully specifies a possible fact which would make it true or false. By contrast, Wittgenstein construes unproven conjectures on the model of riddle phrases, whose meaning, prior to our finding the solution to them, has not been determined. Moreover, Wittgenstein draws our attention to the fact that we can be caught up in an attempt to solve a riddle even if the riddle does not have a solution; the same applies, in his mind, to our engagement with philosophical and mathematical problems. When it comes to philosophical riddles, Wittgenstein is convinced that they do not have a solution at all. The specific difficulty presented by unproven mathematical conjectures is different; in this case, we cannot tell in advance whether or not they present us with a solvable riddle. The paper situates these issues in the context of ongoing debates in the scholarship concerning Wittgenstein’s conception of nonsense, his methodology, his engagement with mathematical realism and verificationism, and his response to skepticism. (shrink)

Wittgenstein’s philosophy of mathematics involves two highly controversial theses: the idea that mathematical propositions are not about (abstract) objects and the idea that no mathematical conjecture is ever answered as such, because the advent of the proof always determines a semantical shift of the meanings of the terms involved in the conjecture. The present article offers a reconstruction of Wittgenstein’s arguments supporting these theses within a very restricted setting: Archimedes’ discovery of an algorithm for calculating the number Pi.

This article offers an explanation of perhaps Wittgenstein’s strangest and least intuitive thesis – the semantical mutation thesis – according to which one can never answer a mathematical conjecture because the new proof alters the very meanings of the terms involved in the original question. Instead of basing our justification on the distinction between mere calculation and proofs of isolated propositions, characteristic of Wittgenstein’s intermediary period, we generalize it to include conjectures involving effective procedures as well.

The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will (...) be argued that one of the reasons why CDs form a good notation is that they are highly mathematically tractable: experts can obtain valid results by ‘calculating’ with CDs. These calculations, take the form of ‘diagram chases’. In order to draw inferences, experts move algebraic elements around the diagrams. It will be argued that these diagrams are dynamic. It is thanks to their dynamicity that CDs can externalize the relevant reasoning and allow experts to draw conclusions directly by manipulating them. Lastly, it will be shown that CDs play essential roles in the context of proof as well as in other phases of the mathematical enterprise, such as discovery and conjecture formation. (shrink)

In this paper, I introduce an intrinsic account of the quantum state. This account contains three desirable features that the standard platonistic account lacks: (1) it does not refer to any abstract mathematical objects such as complex numbers, (2) it is independent of the usual arbitrary conventions in the wave function representation, and (3) it explains why the quantum state has its amplitude and phase degrees of freedom. -/- Consequently, this account extends Hartry Field’s program outlined in Science Without (...) Numbers (1980), responds to David Malament’s long-standing impossibility conjecture (1982), and establishes an important first step towards a genuinely intrinsic and nominalistic account of quantum mechanics. I will also compare the present account to Mark Balaguer’s (1996) nominalization of quantum mechanics and discuss how it might bear on the debate about “wave function realism.” In closing, I will suggest some possible ways to extend this account to accommodate spinorial degrees of freedom and a variable number of particles (e.g. for particle creation and annihilation). -/- Along the way, I axiomatize the quantum phase structure as what I shall call a “periodic difference structure” and prove a representation theorem as well as a uniqueness theorem. These formal results could prove fruitful for further investigation into the metaphysics of phase and theoretical structure. -/- (For a more recent version of this paper, please see "The Intrinsic Structure of Quantum Mechanics" available on PhilPapers.). (shrink)

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the verdicts, hypotheses, or conjectures of any science. In work currently in progress, we argue for the unique suitability of LF for the formalization of logic, mathematics, syntax, and semantics. The present document specifies the language and rules (...) of LF, lays out some notational conventions, and states some basic technical facts about the system. (shrink)

The book is a philosophical refection on the possibility of mathematical history. Are poosible models of historical phenomena so exact as those of physical ones? Mathematical models borrowed from quantum mechanics by the meditation of its interpretations are accomodated to history. The conjecture of many-variant history, alternative history, or counterfactual history is necessary for mathematical history. Conclusions about philosophy of history are inferred.

Gaisi Takeuti (1926–2017) is one of the most distinguished logicians in proof theory after Hilbert and Gentzen. He extensively extended Hilbert's program in the sense that he formulated Gentzen's sequent calculus, conjectured that cut-elimination holds for it (Takeuti's conjecture), and obtained several stunning results in the 1950–60s towards the solution of his conjecture. Though he has been known chiefly as a great mathematician, he wrote many papers in English and Japanese where he expressed his philosophical thoughts. In particular, he used (...) several keywords such as "active intuition" and "self-reflection" from Nishida's philosophy. In this paper, we aim to describe a general outline of our project to investigate Takeuti's philosophy of mathematics. In particular, after reviewing Takeuti's proof-theoretic results briefly, we describe some key elements in Takeuti's texts. By explaining these texts, we point out the connection between Takeuti's proof theory and Nishida's philosophy and explain the future goals of our project. (shrink)

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that there is no effective procedure for ascertaining whether a given procedure is effective. This (...) result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

An isomorphism is built between the separable complex Hilbert space (quantum mechanics) and Minkowski space (special relativity) by meditation of quantum information (i.e. qubit by qubit). That isomorphism can be interpreted physically as the invariance between a reference frame within a system and its unambiguous counterpart out of the system. The same idea can be applied to Poincaré’s conjecture (proved by G. Perelman) hinting another way for proving it, more concise and meaningful physically. Mathematically, the isomorphism means the invariance to (...) choice, the axiom of choice, well-ordering, and well-ordering “theorem” (or “principle”) and can be defined generally as “information invariance”. (shrink)

The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the present such (...) as Fermat’s last theorem, four-color theorem as well as its new-formulated generalization as “four-letter theorem”, Poincaré’s conjecture, “P vs NP” are considered over again, from and within the new-founding conceptual reference frame of information, as illustrations. Simple or crucially simplifying solutions and proofs are demonstrated. The link between the consistent completeness of the system mathematics-physics on the ground of information and all the great mathematical problems of the present (rather than the enumerated ones) is suggested. (shrink)

The paper discusses the origin of dark matter and dark energy from the concepts of time and the totality in the final analysis. Though both seem to be rather philosophical, nonetheless they are postulated axiomatically and interpreted physically, and the corresponding philosophical transcendentalism serves heuristically. The exposition of the article means to outline the “forest for the trees”, however, in an absolutely rigorous mathematical way, which to be explicated in detail in a future paper. The “two deductions” are two (...) successive stage of a single conclusion mentioned above. The concept of “transcendental invariance” meaning ontologically and physically interpreting the mathematical equivalence of the axiom of choice and the well-ordering “theorem” is utilized again. Then, time arrow is a corollary from that transcendental invariance, and in turn, it implies quantum information conservation as the Noether correlate of the linear “increase of time” after time arrow. Quantum information conservation implies a few fundamental corollaries such as the “conservation of energy conservation” in quantum mechanics from reasons quite different from those in classical mechanics and physics as well as the “absence of hidden variables” (versus Einstein’s conjecture) in it. However, the paper is concentrated only into the inference of another corollary from quantum information conservation, namely, dark matter and dark energy being due to entanglement, and thus and in the final analysis, to the conservation of quantum information, however observed experimentally only on the “cognitive screen” of “Mach’s principle” in Einstein’s general relativity. therefore excluding any other source of gravitational field than mass and gravity. Then, if quantum information by itself would generate a certain nonzero gravitational field, it will be depicted on the same screen as certain masses and energies distributed in space-time, and most presumably, observable as those dark energy and dark matter predominating in the universe as about 96% of its energy and matter quite unexpectedly for physics and the scientific worldview nowadays. Besides on the cognitive screen of general relativity, entanglement is available necessarily on still one “cognitive screen” (namely, that of quantum mechanics), being furthermore “flat”. Most probably, that projection is confinement, a mysterious and ad hoc added interaction along with the fundamental tree ones of the Standard model being even inconsistent to them conceptually, as far as it need differ the local space from the global space being definable only as a relation between them (similar to entanglement). So, entanglement is able to link the gravity of general relativity to the confinement of the Standard model as its projections of the “cognitive screens” of those two fundamental physical theories. (shrink)

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite (...) number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it (...) nevertheless leaves two questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator (...) ``in the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$. (shrink)

How, if at all, consciousness can be part of the physical universe remains a baffling problem. This article outlines a new, developing philosophical theory of how it could do so, and offers a preliminary mathematical formulation of a physical grounding for key aspects of the theory. Because the philosophical side has radical elements, so does the physical-theory side. The philosophical side is radical, first, in proposing that the productivity or dynamism in the universe that many believe to be responsible (...) for its systematic regularities is actually itself a physical constituent of the universe, along with more familiar entities. Indeed, it proposes that instances of dynamism can themselves take part in physical interactions with other entities, this interaction then being “meta-dynamism” (a type of meta-causation). Secondly, the theory is radical, and unique, in arguing that consciousness is necessarily partly constituted of meta-dynamic auto-sensitivity, in other words it must react via meta-dynamism to its own dynamism, and also in conjecturing that some specific form of this sensitivity is sufficient for and indeed constitutive of consciousness. The article proposes a way for physical laws to be modified to accommodate meta-dynamism, via the radical step of including elements that explicitly refer to dynamism itself. Additionally, laws become, explicitly, temporally non-local in referring directly to quantity values holding at times prior to a given instant of application of the law. The approach therefore implicitly brings in considerations about what information determines states. Because of the temporal non-locality, and also because of the deep connections between dynamism and time-flow, the approach also implicitly connects to the topic of entropy insofar as this is related to time. (shrink)

In this paper, we propose a mathematical model of subjective experience in terms of classes of hierarchical geometries of representations (“n-awareness”). We first outline a general framework by recalling concepts from higher category theory, homotopy theory, and the theory of (infinity,1)-topoi. We then state three conjectures that enrich this framework. We first propose that the (infinity,1)-category of a geometric structure known as perfectoid diamond is an (infinity,1)-topos. In order to construct a topology on the (infinity,1)-category of diamonds we (...) then propose that topological localization, in the sense of Grothendieck-Rezk-Lurie (infinity,1)-topoi, extends to the (infinity,1)-category of diamonds. We provide a small-scale model using triangulated categories. Finally, our meta-model takes the form of Efimov K-theory of the (infinity,1)-category of perfectoid diamonds, which illustrates structural equivalences between the category of diamonds and subjective experience (i.e.its privacy, self-containedness, and self-reflexivity). Based on this, we investigate implications of the model. We posit a grammar (“n-declension”) for a novel language to express n-awareness, accompanied by a new temporal scheme (“n-time”). Our framework allows us to revisit old problems in the philosophy of time: how is change possible and what do we mean by simultaneity and coincidence? We also examine the notion of “self” within our framework. A new model of personal identity is introduced which resembles a categorical version of the “bundle theory”: selves are not substances in which properties inhere but (weakly) persistent moduli spaces in the K-theory of perfectoid diamonds. (shrink)

This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of (...) an effective procedure, without reliance on any (partially) mathematical thesis or conjecture concerning effective procedures, such as the Church–Turing thesis, that the class of effective procedures is undecidable, i.e., that there is no effective procedure for ascertaining whether a given procedure is effective. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of such a procedure. Though the result itself is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure is, in fact, a decision procedure, i.e., effective—for example, that it invariably terminates with the correct verdict. (shrink)

This paper aims both to tackle the technical issue of deciphering Hobbes’s derivation of the sine law of refraction and to throw some light to the broader issue of Hobbes’s mechanical philosophy. I start by recapitulating the polemics between Hobbes and Descartes concerning Descartes’ optics. I argue that, first, Hobbes’s criticisms do expose certain shortcomings of Descartes’ optics which presupposes a twofold distinction between real motion and inclination to motion, and between motion itself and determination of motion; second, Hobbes’s optical (...) theory presented in Tractatus Opticus I constitutes a more economical alternative, which eliminates the twofold distinction and only admits actual local motion, and Hobbes’s derivation of the sine law presented therein, which I call “the early model” and which was retained in Tractatus Opticus II and First Draught, is mathematically consistent and physically meaningful. These two points give Hobbes’s early optics some theoretical advantage over that of Descartes. However, an issue that has baffled commentators is that, in De Corpore Hobbes’s derivation of the sine law seems to be completely different from that presented in his earlier works, furthermore, it does not make any intuitive sense. I argue that the derivation of the sine law in De Corpore does make sense mathematically if we read it as a simplification of the early model, and Hobbes has already hinted toward it in the last proposition of Tractatus Opticus I. But now the question becomes, why does Hobbes take himself to be entitled to present this simplified, seemingly question-begging form without having presented all the previous results? My conjecture is that the switch from the early model to the late model is symptomatic of Hobbes’s changing views on the relation between physics and mathematics. (shrink)

The explicit history of the “hidden variables” problem is well-known and established. The main events of its chronology are traced. An implicit context of that history is suggested. It links the problem with the “conservation of energy conservation” in quantum mechanics. Bohr, Kramers, and Slaters (1924) admitted its violation being due to the “fourth Heisenberg uncertainty”, that of energy in relation to time. Wolfgang Pauli rejected the conjecture and even forecast the existence of a new and unknown then elementary particle, (...) neutrino, on the ground of energy conservation in quantum mechanics, afterwards confirmed experimentally. Bohr recognized his defeat and Pauli’s truth: the paradigm of elementary particles (furthermore underlying the Standard model) dominates nowadays. However, the reason of energy conservation in quantum mechanics is quite different from that in classical mechanics (the Lie group of all translations in time). Even more, if the reason was the latter, Bohr, Cramers, and Slatters’s argument would be valid. The link between the “conservation of energy conservation” and the problem of hidden variables is the following: the former is equivalent to their absence. The same can be verified historically by the unification of Heisenberg’s matrix mechanics and Schrödinger’s wave mechanics in the contemporary quantum mechanics by means of the separable complex Hilbert space. The Heisenberg version relies on the vector interpretation of Hilbert space, and the Schrödinger one, on the wave-function interpretation. However the both are equivalent to each other only under the additional condition that a certain well-ordering is equivalent to the corresponding ordinal number (as in Neumann’s definition of “ordinal number”). The same condition interpreted in the proper terms of quantum mechanics means its “unitarity”, therefore the “conservation of energy conservation”. In other words, the “conservation of energy conservation” is postulated in the foundations of quantum mechanics by means of the concept of the separable complex Hilbert space, which furthermore is equivalent to postulating the absence of hidden variables in quantum mechanics (directly deducible from the properties of that Hilbert space). Further, the lesson of that unification (of Heisenberg’s approach and Schrödinger’s version) can be directly interpreted in terms of the unification of general relativity and quantum mechanics in the cherished “quantum gravity” as well as a “manual” of how one can do this considering them as isomorphic to each other in a new mathematical structure corresponding to quantum information. Even more, the condition of the unification is analogical to that in the historical precedent of the unifying mathematical structure (namely the separable complex Hilbert space of quantum mechanics) and consists in the class of equivalence of any smooth deformations of the pseudo-Riemannian space of general relativity: each element of that class is a wave function and vice versa as well. Thus, quantum mechanics can be considered as a “thermodynamic version” of general relativity, after which the universe is observed as if “outside” (similarly to a phenomenological thermodynamic system observable only “outside” as a whole). The statistical approach to that “phenomenological thermodynamics” of quantum mechanics implies Gibbs classes of equivalence of all states of the universe, furthermore re-presentable in Boltzmann’s manner implying general relativity properly … The meta-lesson is that the historical lesson can serve for future discoveries. (shrink)

The “four-color” theorem seems to be generalizable as follows. The four-letter alphabet is sufficient to encode unambiguously any set of well-orderings including a geographical map or the “map” of any logic and thus that of all logics or the DNA plan of any alive being. Then the corresponding maximally generalizing conjecture would state: anything in the universe or mind can be encoded unambiguously by four letters. That admits to be formulated as a “four-letter theorem”, and thus one can search for (...) a properly mathematical proof of the statement. It would imply the “four colour theorem”, the proof of which many philosophers and mathematicians believe not to be entirely satisfactory for it is not a “human proof”, but intermediated by computers unavoidably since the necessary calculations exceed the human capabilities fundamentally. It is furthermore rather unsatisfactory because it consists in enumerating and proving all cases one by one. Sometimes, a more general theorem turns out to be much easier for proving including a general “human” method, and the particular and too difficult for proving theorem to be implied as a corollary in certain simple conditions. The same approach will be followed as to the four colour theorem, i.e. to be deduced more or less trivially from the “four-letter theorem” if the latter is proved. References are only classical and thus very well-known papers: their complete bibliographic description is omitted. (shrink)

Interest has been renewed in the study of consciousness, both theoretical and applied, following developments in 20th and early 21st-century logic, metamathematics, computer science, and the brain sciences. In this evolving narrative, I explore several theoretical questions about the types of artificial intelligence and offer several conjectures about how they affect possible future developments in this exceptionally transformative field of research. I also address the practical significance of the advances in artificial intelligence in view of the cautions issued by (...) prominent scientists, politicians, and ethicists about the possible dangers of such sufficiently advanced general intelligence, including by implication the search for extraterrestrial intelligence. (shrink)

The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.

Clayton and Stevens argue that political liberals should engage with the religiously unreasonable by offering religious responses and showing that their religious views are mistaken, instead of refusing to engage with them. Yet they recognize that political liberals will face a dilemma due to such religious responses: either their responses will alienate certain reasonable citizens, or their engagements will appear disingenuous. Thus, there should be a division of justificatory labour. The duty of engagement should be delegated to religious citizens. In (...) this comment, I will argue that the division of justificatory labour is indefensible. This dilemma can be avoided if politicians and political philosophers correctly use conjecture, a form of discourse that involves non-public reason. As a conditional response, conjecture avoids alienating any reasonable citizens. Also, if conjecture is given in a sincere and open-minded manner, then the problem of disingenuousness can be overcome. My comment concludes that while the engagement of politicians and political philosophers does not necessarily jeopardize overlapping consensus, they should be permitted, or perhaps even required, to engage with the religiously unreasonable due to the natural duty of justice. (shrink)

In this short note many conjectures on partitions of integers as summations of prime numbers are presented, which are extension of Goldbach conjecture.

This is a conjecture about the conditions and operating structures that are required for the phenomenality of certain mental states. Specifically, full-blown phenomenality is assumed, as contrasted with constrained examples of phenomenal experience such as sensations of color and pain. Propositional attitudes and content, while not phenomenal per se, are standardly concurrent and may condition phenomenal states (e.g., when tied to false beliefs). It is conjectured that full phenomenality natively arises in coherent processes of situated sensory synthesis and representation (with (...) conceptual content) that are looped, mereologically whole and multi-dimensional. And that phenomenal states are typically phase-states within a parameterized conjoint structure of world and experiencer processes that are causally modulated across Markov blankets (which are conditionally independent and may be nested: cf. M. Kirchoff, et. al., 2017, 2018; and T. Burge, 2010, re: anti-individualism). Though they may, it is not accepted that phenomenally conscious states must be targets of higher-order representations (cf. A. Byrne, 2004). (shrink)