In this paper intuitionistic set theory INC# in infinitary set theoretical language is considered. External induction principle in nonstandard intuitionistic arithmetic were derived. Non trivial application in number theory is considered.

Main results are: (i) number e^{e} is transcendental; (ii) the both numbers e+π and e-π are irrational.

Within the framework of Positive Psychology and Needing Theories, this article reviews cultural practices or perceptions regarding what happiness is and how it can be achieved. Mainly research on Subjective Well-Being (SWB) has identified many cultural differences in the pursuit of happiness, often described as East-West splits along categories such as highly expressed affect vs. quiet affect, self-assertion vs. conformity to social norms, independence vs. interdependence and the like. However, it is the overall goal of this article to show that (...) whatever the normative content of a culture’s or subculture’s view of happiness may be, it involves the same basic psychological needs beyond how people may choose to report or express resulting emotions. In particular, the theory of happiness proposed by the Hellenistic philosopher Epicurus provides broader, more inclusive categories and concepts which can be used to explain and possibly harmonize assumptions from particular traditions. (shrink)

This article presents a detailed methodological outline for teaching culture through project work. It is argued that because project work makes it possible to gain transferrable and applicable knowledge and insight, it is the ideal tool for teaching culture with the aim of achieving real intercultural communicative competence (ICC). Preceding the pedagogical presentation, the term culture is conceptualized as small-c culture/deep culture, that is, as the sociopsychological programming of a given community. This concept is developed with practical examples and conceptualizations (...) for pedagogical implementability. Finally, a project course with American undergraduate students conducted in Germany is briefly presented. This presentation includes project sheets, the methodological rationale of each project, and the observations the participants made during the course. These observations include many aspects of the way German and U.S. American deep culture differ and also shed light on the “truth” behind some German cultural clichés. (shrink)

This chapter presents a task-based lesson sequence based on Judith Butler's Gender Trouble. Gender Trouble is a great piece of philosophical literature. However, as philosophical literature is a genre rarely found in EFL teaching, this chapter first demonstrates in detail the merits of this genre for the teaching ofEnglish for Academic Purposes. After a brief analysis of the source text, which deconstructs the entire sex-gender link and presents both sex and gender as free-floating, this chapter presents task-based methodology and how (...) it is utilized in a lesson aimed at building gender awareness and acceptance. In the target task students are asked to take the role of an ethics teacher at an Irish high school, in which the discussion arose whether the school should introduce unisex toilets and changing rooms in order to not discriminate against transsexual students. Tue study of Butler's philosophy will provide students with both the knowledge and language to accomplish this task. Open follow-up discussions often lead to powerful ethical insights in the context of gender, homo- and transsexuality. (shrink)

Neuroeducation as an amalgamation of neuroscience, cognitive science and educational psychology has the explicit aim of improving classroom teaching and learning and has repeatedly stressed the role of the teacher in student motivation and learning. This article briefly reviews the nature of human learning from the perspective of neuroeducation and presents four factors of successful learning as a consequence of this line of research. These four factors relate to the credibility of the teacher, individual differences, the role of a positive (...) classroom climate and the activation of previous knowledge. (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.

Dutch book and accuracy arguments are used to justify certain rationality constraints on credence functions. Underlying these Dutch book and accuracy arguments are associated theorems, and I show that the interpretation of these theorems can vary along a range of dimensions. Given that the theorems can be interpreted in a variety of different ways, what is the status of the associated arguments? I consider three possibilities: we could aggregate the results of the differently interpreted theorems in some way, and motivate (...) rationality constraints based on this aggregation; we could be permissive, and accept the conclusions of the Dutch book and accuracy arguments under all interpretations of the associated theorems; or we could select one uniquely correct interpretation of the Dutch book or accuracy theorem, and use that to justify certain rationality constraints. I show that each possibility faces problems, and conclude that Dutch book and accuracy theorems cannot be used to justify any principle of rationality. (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.

This chapter looks at Euler’s relation to Newton, and at his role in the rise of ‘Newtonian’ mechanics. It aims to give a sense of Newton’s complicated legacy for Enlightenment science, and to raise awareness that some key ‘Newtonian’ results really come from Euler.

Democratic decision-making is often defended on grounds of the ‘wisdom of crowds’: decisions are more likely to be correct if they are based on many independent opinions, so a typical argument in social epistemology. But what does it mean to have independent opinions? Opinions can be probabilistically dependent even if individuals form their opinion in causal isolation from each other. We distinguish four probabilistic notions of opinion independence. Which of them holds depends on how individuals are causally affected by environmental (...) factors such as commonly perceived evidence. In a general theorem, we identify causal conditions guaranteeing each kind of opinion independence. These results have implications for whether and how ‘wisdom of crowds’ arguments are possible, and how truth-conducive institutions can be designed. (shrink)

A teaching document I've used in my courses on truth and on incompleteness. Aimed at students who have a good grasp of basic logic, and decent math skills, it attempts to give them the background they need to understand a proper statement of the classic results due to Gödel and Tarski, and sketches their proofs. Topics covered include the notions of language and theory, the basics of formal syntax and arithmetization, formal arithmetic (Q and PA), representability, diagonalization, and the incompleteness (...) and undefinability theorems. (shrink)

Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As a result, we (...) should reject these claims, and lay the foundations of decision theory on firmer ground. (shrink)

Emilie Du Chatelet and Christian Wolff both argue, from the principle of sufficient reason, that extended objects and composite objects simpliciter must ultimately be composed of simple beings (monads). Leonhard Euler, who makes extended use of the principle of sufficient reason in his works on mechanics and natural science, argues the contrary: Every extended object is composed of other, composite, extended objects. In this chapter I attempt to locate the differences between these figures that drive them to disparate conclusions. (...) I argue that the difference comes, not from their different applications of the principle of sufficient reason, but from two other sources. First, they endorse different explicability principles which do not themselves follow from the principle of sufficient reasons; and second, they differ with respect to the kinds of explanations (what I call that-explanations and how-explanations) that the question of the composition of extension requires. (shrink)

This work describes a seminal framework of law by one of the founders of the field of law and economics, Judge Guido Calabresi. It broadens what is known as the framework of law among legal scholars, and posits a calabresi theorem which is developed and explained, in part, in comparison to the coase theorem. The framework provides policymakers a tool for creating balanced policies.

Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems spans across various disciplines such (...) as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)

We examine the influence of word choices on mathematical practice, i.e. in developing definitions, theorems, and proofs. As a case study, we consider Euclid’s and Euler’s word choices in their influential developments of geometry and, in particular, their use of the term ‘polyhedron’. Then, jumping to the twentieth century, we look at word choices surrounding the use of the term ‘polyhedron’ in the work of Coxeter and of Grünbaum. We also consider a recent and explicit conflict of approach between (...) Grünbaum and Shephard on the one hand and that of Hilton and Pedersen on the other, elucidating that the conflict was engendered by disagreement over the proper conceptualization, and so also the appropriate word choices, in the study of polyhedra. (shrink)

In this paper I argue for an association between impurity and explanatory power in contemporary mathematics. This proposal is defended against the ancient and influential idea that purity and explanation go hand-in-hand (Aristotle, Bolzano) and recent suggestions that purity/impurity ascriptions and explanatory power are more or less distinct (Section 1). This is done by analyzing a central and deep result of additive number theory, Szemerédi’s theorem, and various of its proofs (Section 2). In particular, I focus upon the radically (...) impure (ergodic) proof due to Furstenberg (Section 3). Furstenberg’s ergodic proof is striking because it utilizes intuitively foreign and infinitary resources to prove a finitary combinatorial result and does so in a perspicuous fashion. I claim that Furstenberg’s proof is explanatory in light of its clear expression of a crucial structural result, which provides the “reason why” Szemerédi’s theorem is true. This is, however, rather surprising: how can such intuitively different conceptual resources “get a grip on” the theorem to be proved? I account for this phenomenon by articulating a new construal of the content of a mathematical statement, which I call structural content (Section 4). I argue that the availability of structural content saves intuitive epistemic distinctions made in mathematical practice and simultaneously explicates the intervention of surprising and explanatorily rich conceptual resources. Structural content also disarms general arguments for thinking that impurity and explanatory power might come apart. Finally, I sketch a proposal that, once structural content is in hand, impure resources lead to explanatory proofs via suitably understood varieties of simplification and unification (Section 5). (shrink)

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

This paper begins with a puzzle regarding Lewis' theory of radical interpretation. On the one hand, Lewis convincingly argued that the facts about an agent's sensory evidence and choices will always underdetermine the facts about her beliefs and desires. On the other hand, we have several representation theorems—such as those of (Ramsey 1931) and (Savage 1954)—that are widely taken to show that if an agent's choices satisfy certain constraints, then those choices can suffice to determine her beliefs and desires. In (...) this paper, I will argue that Lewis' conclusion is correct: choices radically underdetermine beliefs and desires, and representation theorems provide us with no good reasons to think otherwise. Any tension with those theorems is merely apparent, and relates ultimately to the difference between how 'choices' are understood within Lewis' theory and the problematic way that they're represented in the context of the representation theorems. For the purposes of radical interpretation, representation theorems like Ramsey's and Savage's just aren't very relevant after all. (shrink)

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, (...) machine learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

In this short survey article, I discuss Bell’s theorem and some strategies that attempt to avoid the conclusion of non-locality. I focus on two that intersect with the philosophy of probability: (1) quantum probabilities and (2) superdeterminism. The issues they raised not only apply to a wide class of no-go theorems about quantum mechanics but are also of general philosophical interest.

Pettit (2012) presents a model of popular control over government, according to which it consists in the government being subject to those policy-making norms that everyone accepts. In this paper, I provide a formal statement of this interpretation of popular control, which illuminates its relationship to other interpretations of the idea with which it is easily conflated, and which gives rise to a theorem, similar to the famous Gibbard-Satterthwaite theorem. The theorem states that if government policy is (...) subject to popular control, as Pettit interprets it, and policy responds positively to changes in citizens' normative attitudes, then there is a single individual whose normative attitudes unilaterally determine policy. I use the model and theorem as an illustrative example to discuss the role of mathematics in normative political theory. (shrink)

Philosophers of language have drawn on metamathematical results in varied ways. Extensionalist philosophers have been particularly impressed with two, not unrelated, facts: the existence, due to Frege/Tarski, of a certain sort of semantics, and the seeming absence of intensional contexts from mathematical discourse. The philosophical import of these facts is at best murky. Extensionalists will emphasize the success and clarity of the model theoretic semantics; others will emphasize the relative poverty of the mathematical idiom; still others will question the aptness (...) of the standard extensional semantics for mathematics. In this paper I investigate some implications of the Gödel Second Incompleteness Theorem for these positions. I argue that the realm of mathematics, proof theory in particular, has been a breeding ground for intensionality and that satisfactory intensional semantic theories are implicit in certain rigorous technical accounts. (shrink)

In this paper a symmetry argument against quantity absolutism is amended. Rather than arguing against the fundamentality of intrinsic quantities on the basis of transformations of basic quantities, a class of symmetries defined by the Π-theorem is used. This theorem is a fundamental result of dimensional analysis and shows that all unit-invariant equations which adequately represent physical systems can be put into the form of a function of dimensionless quantities. Quantity transformations that leave those dimensionless quantities invariant are (...) empirical and dynamical symmetries. The proposed symmetries of the original argument fail to be both dynamical and empirical symmetries and are open to counterexamples. The amendment of the original argument requires consideration of the relationships between quantity dimensions. The discussion raises a pertinent issue: what is the modal status of the constants of nature which figure in the laws? Two positions, constant necessitism and constant contingentism, are introduced and their relationships to absolutism and comparativism undergo preliminary investigation. It is argued that the absolutist can only reject the amended symmetry argument by accepting constant necessitism. I argue that the truth of an epistemically open empirical hypothesis would make the acceptance of constant necessitism costly: together they entail that the facts are nomically necessary. (shrink)

In his recent article Christopher Gauker (2001) has presented a thoughtprovoking argument against deflationist theories of truth. More exactly, he attacks what he calls ‘T-schema deflationism’, that is, the claim that a theory of truth can simply take the form of certain instances of the T-schema.

A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of each model or hypothesis. Thomas Bayes’ Theorem relates the data and prior information to posterior probabilities associated with differing models or hypotheses and thus is useful in identifying the roles played by the known data and the assumed prior information when making (...) inferences. Scientists, philosophers, and theologians accumulate knowledge when analyzing different aspects of reality and search for particular hypotheses or models to fit their respective subject matters. Of course, a main goal is then to integrate all kinds of knowledge into an all-encompassing worldview that would describe the whole of reality. A generous description of the whole of reality would span, in the order of complexity, from the purely physical to the supernatural. These two extreme aspects of reality are bridged by a nonphysical realm, which would include elements of life, man, consciousness, rationality, mental and mathematical abstractions, etc. An urgent problem in the theory of knowledge is what science is and what it is not. Albert Einstein’s notion of science in terms of sense perception is refined by defining operationally the data that makes up the subject matter of science. It is shown, for instance, that theological considerations included in the prior information assumed by Isaac Newton is irrelevant in relating the data logically to the model or hypothesis. In addition, the concepts of naturalism, intelligent design, and evolutionary theory are critically analyzed. Finally, Eugene P. Wigner’s suggestions concerning the nature of human consciousness, life, and the success of mathematics in the natural sciences is considered in the context of the creative power endowed in humans by God. (shrink)

Logic diagrams have been increasingly studied and applied for a few decades, not only in logic, but also in many other fields of science. The history of logic diagrams is an important subject, as many current systems and applications of logic diagrams are based on historical predecessors. While traditional histories of logic diagrams cite pioneers such as Leibniz, Euler, Venn, and Peirce, it is not widely known that Kant and the early Kantians in Germany and England played a crucial (...) role in popularising Euler(-type) diagrams. In this paper, the role of the Kantians in the late eighteenth and early nineteenth centuries will be analysed in more detail. It shows that diagrams (or intuition in general) were a highly contentious topic that depend on the philosophical attitude and went beyond logic to touch on issues of physics, metaphysics, linguistics and, above all, mathematics. (shrink)

In this work we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingale representation in case of discrete time and an application of the result for semi-continuous market model are also given.

The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure (...) of a subspace of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)

There is a theorem that shows that it is impossible for an algorithm to jointly satisfy the statistical fairness criteria of Calibration and Equalised Odds non-trivially. But what about the recently advocated alternative to Calibration, Base Rate Tracking? Here, we show that Base Rate Tracking is strictly weaker than Calibration, and then take up the question of whether it is possible to jointly satisfy Base Rate Tracking and Equalised Odds in non-trivial scenarios. We show that it is not, thereby (...) establishing an even more general impossibility theorem. (shrink)

One might think that if the majority of virtue signallers judge that a proposition is true, then there is significant evidence for the truth of that proposition. Given the Condorcet Jury Theorem, individual virtue signallers need not be very reliable for the majority judgment to be very likely to be correct. Thus, even people who are skeptical of the judgments of individual virtue signallers should think that if a majority of them judge that a proposition is true, then that (...) provides significant evidence that the proposition is true. We argue that this is mistaken. Various empirical studies converge on the following point: humans are very conformist in the contexts in which virtue signalling occurs. And stereotypical virtue signallers are even more conformist in such contexts. So we should be skeptical of the claim that virtue signallers are sufficiently independent for the Condorcet Jury Theorem to apply. We do not seek to decisively rule out the relevant application of the Condorcet Jury Theorem. But we do show that careful consideration of the available evidence should make us very skeptical of that application. Consequently, a defense of virtue signalling would need to engage with these findings and show that despite our strong tendencies for conformism, our judgements are sufficiently independent for the Condorcet Jury Theorem to apply. This suggests new directions for the debate about the epistemology of virtue signalling. (shrink)

A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional methodologies studying (...) infinities and infinitesimals only symbolically. The grossone methodology uses the Euclid’s Common Notion no. 5 ‘The whole is greater than the part’ and applies it to finite, infinite, and infinitesimal quantities and to finite and infinite sets and processes. It does not contradict Cantor’s and non-standard analysis views on infinity and can be considered as an applied development of their ideas. In this paper we consider infinite series and a particular attention is dedicated to divergent series with alternate signs. The Riemann series theorem states that conditionally convergent series can be rearranged in such a way that they either diverge or converge to an arbitrary real number. It is shown here that Riemann’s result is a consequence of the fact that symbol ∞ used traditionally does not allow us to express quantitatively the number of addends in the series, in other words, it just shows that the number of summands is infinite and does not allows us to count them. The usage of the grossone methodology allows us to see that (as it happens in the case where the number of addends is finite) rearrangements do not change the result for any sum with a fixed infinite number of summands. There are considered some traditional summation techniques such as Ramanujan summation producing results where to divergent series containing infinitely many positive integers negative results are assigned. It is shown that the careful counting of the number of addends in infinite series allows us to avoid this kind of results if grossone-based numerals are used. (shrink)

A proof of Fermat’s last theorem is demonstrated. It is very brief, simple, elementary, and absolutely arithmetical. The necessary premises for the proof are only: the three definitive properties of the relation of equality (identity, symmetry, and transitivity), modus tollens, axiom of induction, the proof of Fermat’s last theorem in the case of n = 3 as well as the premises necessary for the formulation of the theorem itself. It involves a modification of Fermat’s approach of infinite (...) descent. The infinite descent is linked to induction starting from n = 3 by modus tollens. An inductive series of modus tollens is constructed. The proof of the series by induction is equivalent to Fermat’s last theorem. As far as Fermat had been proved the theorem for n = 4, one can suggest that the proof for n ≥ 4 was accessible to him. An idea for an elementary arithmetical proof of Fermat’s last theorem (FLT) by induction is suggested. It would be accessible to Fermat unlike Wiles’s proof (1995). (shrink)

The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in out- line why Putnam’s result, and likewise the more restricted result we call the Multiple- Computations Theorem, are in fact theorems of statistical mechanics. We show why the mere interaction of a computing system with its environment cannot single out a computation as the preferred one amongst the many computations implemented by the system. We explain why (...) nonreductive approaches to solving the multiple- computations problem, and in particular why computational externalism, are dualistic in the sense that they imply that nonphysical facts in the environment of a computing system single out the computation. We discuss certain attempts to dissolve Putnam’s unrestricted result by appealing to systems with certain kinds of input and output states as a special case of computational externalism, and show why this approach is not workable without collapsing to behaviorism. We conclude with some remarks about the nonphysical nature of mainstream approaches to both statistical mechanics and the quantum theory of measurement with respect to the singling out of partitions and observables. (shrink)

Our conscious minds exist in the Universe, therefore they should be identified with physical states that are subject to physical laws. In classical theories of mind, the mental states are identified with brain states that satisfy the deterministic laws of classical mechanics. This approach, however, leads to insurmountable paradoxes such as epiphenomenal minds and illusionary free will. Alternatively, one may identify mental states with quantum states realized within the brain and try to resolve the above paradoxes using the standard Hilbert (...) space formalism of quantum mechanics. In this essay, we first show that identification of mind states with quantum states within the brain is biologically feasible, and then elaborating on the mathematical proofs of two quantum mechanical no-go theorems, we explain why quantum theory might have profound implications for the scientific understanding of one's mental states, self identity, beliefs and free will. (shrink)

We show that the respective oversights in the von Neumann's general theorem against all hidden variable theories and Bell's theorem against their local-realistic counterparts are homologous. When latter oversight is rectified, the bounds on the CHSH correlator work out to be ±2√2 instead of ±2.

I argue that Composition as Identity blocks the plural version of Cantor's Theorem, and that therefore the plural version of Cantor's Theorem can no longer be uncritically appealed to. As an example, I show how this result blocks a recent argument by Hawthorne and Uzquiano.

In (Weaver 2021), I showed that Boltzmann’s H-theorem does not face a significant threat from the reversibility paradox. I argue that my defense of the H-theorem against that paradox can be used yet again for the purposes of resolving the recurrence paradox without having to endorse heavy-duty statistical assumptions outside of the hypothesis of molecular chaos. As in (Weaver 2021), lessons from the history and foundations of physics reveal precisely how such resolution is achieved.

Peano arithmetic cannot serve as the ground of mathematics for it is inconsistent to infinity, and infinity is necessary for its foundation. Though Peano arithmetic cannot be complemented by any axiom of infinity, there exists at least one (logical) axiomatics consistent to infinity. That is nothing else than a new reading at issue and comparative interpretation of Gödel’s papers (1930; 1931) meant here. Peano arithmetic admits anyway generalizations consistent to infinity and thus to some addable axiom(s) of infinity. The most (...) utilized example of those generalizations is the complex Hilbert space. Any generalization of Peano arithmetic consistent to infinity, e.g. the complex Hilbert space, can serve as a foundation for mathematics to found itself and by itself. (shrink)

The determinism-free will debate is perhaps as old as philosophy itself and has been engaged in from a great variety of points of view including those of scientific, theological, and logical character. This chapter focuses on two arguments from logic. First, there is an argument in support of determinism that dates back to Aristotle, if not farther. It rests on acceptance of the Law of Excluded Middle, according to which every proposition is either true or false, no matter whether the (...) proposition is about the past, present or future. In particular, the argument goes, whatever one does or does not do in the future is determined in the present by the truth or falsity of the corresponding proposition. The second argument coming from logic is much more modern and appeals to Gödel's incompleteness theorems to make the case against determinism and in favour of free will, insofar as that applies to the mathematical potentialities of human beings. The claim more precisely is that as a consequence of the incompleteness theorems, those potentialities cannot be exactly circumscribed by the output of any computing machine even allowing unlimited time and space for its work. The chapter concludes with some new considerations that may be in favour of a partial mechanist account of the mathematical mind. (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)

Suppose that a majority of jurors decide that a defendant is guilty (or not), and we want to know the likelihood that they reached the correct verdict. The French philosopher Marquis de Condorcet (1743-1794) showed that we can get a mathematically precise answer, a result known as the “Condorcet Jury Theorem.” Condorcet’s theorem isn’t just about juries, though; it’s about collective decision-making in general. As a result, some philosophers have used his theorem to argue for democratic forms (...) of government. This essay explains Condorcet’s theorem and how philosophers have used it as an argument for democracy. (shrink)

Mathematical instrumentalism construes some parts of mathematics, typically the abstract ones, as an instrument for establishing statements in other parts of mathematics, typically the elementary ones. Gödel’s second incompleteness theorem seems to show that one cannot prove the consistency of all of mathematics from within elementary mathematics. It is therefore generally thought to defeat instrumentalisms that insist on a proof of the consistency of abstract mathematics from within the elementary portion. This article argues that though some versions of mathematical (...) instrumentalism are defeated by Gödel’s theorem, not all are. By considering inductive reasons in mathematics, we show that some mathematical instrumentalisms survive the theorem. (shrink)

Sequel to Part I. In these articles, I describe Cantor’s power-class theorem, as well as a number of logical and philosophical paradoxes that stem from it, many of which were discovered or considered (implicitly or explicitly) in Bertrand Russell’s work. These include Russell’s paradox of the class of all classes not members of themselves, as well as others involving properties, propositions, descriptive senses, class-intensions and equivalence classes of coextensional properties. Part II addresses Russell’s own various attempts to solve these (...) paradoxes, including strategies that he considered and rejected (limitation of size, the zigzag theory, etc.), as well as his own final views whereupon many purported entities that, if reified, lead to these contradictions, must not be genuine entities, but ‘logical fictions’ or ‘logical constructions’ instead. (shrink)

In these articles, I describe Cantor’s power-class theorem, as well as a number of logical and philosophical paradoxes that stem from it, many of which were discovered or considered (implicitly or explicitly) in Bertrand Russell’s work. These include Russell’s paradox of the class of all classes not members of themselves, as well as others involving properties, propositions, descriptive senses, class-intensions, and equivalence classes of coextensional properties. Part I focuses on Cantor’s theorem, its proof, how it can be used (...) to manufacture paradoxes, Frege’s diagnosis of the core difficulty, and several broad categories of strategies for offering solutions to these paradoxes. (shrink)

This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...) of democratic decision-making principles may be developed by social scientists whose leanings may be toward the left or right side of the spectrum of political practices. (shrink)

We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most jury theorems; (...) (ii) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)