Traditional epistemology of knowledge and belief can be succinctly characterized as JTB-epistemology, i.e., it is characterized by the thesis that knowledge is justified true belief. Since Gettier’s trail-blazing paper of 1963 this account has become under heavy attack. The aim of is paper is to study the Gettier problem and related issues in the framework of topological epistemic logic. It is shown that in the framework of topological epistemic logic Gettier situations necessarily occur for most topological models of knowledge and (...) belief. On the other hand, there exists a special class of topological models (based on so called nodec spaces) for which traditional JTB-epistemology is valid. Further, it is shown that for each topological model of Stalnaker’s combined logic KB of knowledge and belief a canonical JTB-model (its JTB-doppelganger) can be constructed that shares many structural properties with the original model but is free of Gettier situations. The topological model and its JTB-doppelganger both share the same justified belief operator and have very similar knowledge operators. Seen from a somewhat different perspective, the JTB-account of epistemology amounts to a simplification of a more general epistemological account of knowledge and belief that assumes that these two concepts may differ in some cases. The JTB-account of knowledge and belief assumes that the epistemic agent’s cognitive powers are rather large. Thereby in the JTB-epistemology Gettier cases do not occur. Eventually, it is shown that for all topological models of Stalnaker’s KB- logic Gettier situations are topologically characterized as nowhere dense situations. This entails that Gettier situations are epistemologically invisible in the sense that they can neither be known nor believed with justification with respect to the knowledge operator and the belief operator of the models involved. Keywords. Stalnaker’s logic KB of knowledge and belief; Topological epistemology; Epistemic Invisibility; Doxastic invisibility; Gettier cases; . (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)

The importance of the plankton is well recognized as these have vital part in food chain and play a key role in cycling of organic matter in the aquatic ecosystem. The inadequate knowledge of plankton and their dynamics is a major drawback for the better understanding of the life process of fresh water bodies. In the present investigation, total 23 species of phytoplankton and 22 species of zooplankton were also recorded. Bimodal pattern of seasonal variation of plankton was observed with (...) a primary peak in the month of July and secondary peak in January. The physico-chemical and biological conditions were found suitable for fish culture and agriculture. (shrink)

Abstract: In this paper, the definition of triple Aboodh transform of fractional order α, where α ϵ [0, 1], is introduced for functions which are fractional differentiable. We also present several properties of this transform. Furthermore, some main theorems and their proofs are discussed.

This paper has three main goals. First, to motivate a puzzle about how ignorance-expressing terms like maybe and if interact: they iterate, and when they do they exhibit scopelessness. Second, to argue that there is an ambiguity in our theoretical toolbox, and that exposing that opens the door to a solution to the puzzle. And third, to explore the reach of that solution. Along the way, the paper highlights a number of pleasing properties of two elegant semantic theories, explores some (...) meta-theoretic properties of dynamic notions of meaning, dips its toe into some hazardous waters, and offers characterization theorems for the space of meanings an indicative conditional can have. (shrink)

In Everettian quantum mechanics, justifications for the Born rule appeal to self-locating uncertainty or decision theory. Such justifications have focused exclusively on a pure-state Everettian multiverse, represented by a wave function. Recent works in quantum foundations suggest that it is viable to consider a mixed-state Everettian multiverse, represented by a (mixed-state) density matrix. Here, we develop the conceptual foundations for decoherence and branching in a mixed-state multiverse, and extend the standard Everettian justifications for the Born rule to this setting. (...) This extended framework provides a unification of 'classical' and 'quantum' probabilities, and additional theoretical benefits, for the Everettian picture. (shrink)

Abstract— In this paper, we introduce the definition of triple Aboodh transform, some properties for the transform are presented. Furthermore, several theorems dealing with the properties of the triple Aboodh transform are proved. In addition, we use this transform to solve partial differential equations with integer and non-integer orders.

This paper sets mathematics among the sciences, despite not being empirical, because it studies relations of various sorts, like the sciences. Each empirical science studies the relations among objects, which relations determining which science. The mathematical science studies relations as such, regardless of what those relations may be or be among, how relations themselves are related. This places it at the extreme among the sciences with no objects of its own (A Subject with no Object, by J.P. Burgess and G. (...) Rosen). Examples are discussed. The historical development of written mathematics from algorithms on clay tablets to theorems with proofs is said to show that application of algorithms to specific problems and theorems to scientific objects is like allegorical interpretation. Mathematics fits into the modern scientific context because the sciences, beginning with Galileo, have been constructed in imitation of mathematics. Viewing mathematics this way does not solve any ontological problems, but it does show how mathematics avoids them. Epistemological problems, insuperable for object realism, are simplified. For example, we have access to relations among any objects that we can consider objectively, first physical objects and then mathematical objects of greater and greater abstraction. (shrink)

We propose a natural definition of what it means in a constructive context for a Banach space to be reflexive, and then prove a constructive counterpart of the Milman-Pettis theorem that uniformly convex Banach spaces are reflexive.

Shows how, as a consequence of the Arrow Impossibility Theorem, objectivity in grading is chimerical, given a sufficiently knowledgeable teacher (of his students, not his subject) in a sufficiently small class. -/- PDF available from JStor only; permission to post full version previously granted by journal editors and publisher expired. -/- Unpublished reply posted gratis.

To naturalize religion, we must identify what religion is, and what aspects of it we are trying to explain. In this paper, religious social institutional behavior is the explanatory target, and an explanatory hypothesis based on shared primate social dominance psychology is given. The argument is that various religious features, including the high status afforded the religious, and the high status afforded to deities, are an expression of this social dominance psychology in a context for which it did not evolve: (...) high-density populations made possible by agriculture. (shrink)

We extend the framework of Inductive Logic to Second Order languages and introduce Wilmers' Principle, a rational principle for probability functions on Second Order languages. We derive a representation theorem for functions satisfying this principle and investigate its relationship to the first order principles of Regularity and Super Regularity.

Whether it was John Searle’s Chinese Room argument (Searle, 1980) or Roger Penrose’s argument of the non-computable nature of a mathematician’s insight – an argument that was based on Gödel’s Incompleteness theorem (Penrose, 1989), we have always had skeptics that questioned the possibility of realizing strong Artificial Intelligence (AI), or what has become known by Artificial General Intelligence (AGI). But this new book by Landgrebe and Smith (henceforth, L&S) is perhaps the strongest argument ever made against strong AI. It (...) is a very extensive review of what building a mind essentially amounts to drawing on insights and results from biology, physics, linguistics, computability, philosophy, and mathematics. (shrink)

Majority cycling and related social choice paradoxes are often thought to threaten the meaningfulness of democracy. But deliberation can prevent majority cycles – not by inducing unanimity, which is unrealistic, but by bringing preferences closer to single-peakedness. We present the first empirical test of this hypothesis, using data from Deliberative Polls. Comparing preferences before and after deliberation, we find increases in proximity to single-peakedness. The increases are greater for lower versus higher salience issues and for individuals who seem to have (...) deliberated more versus less effectively. They are not merely a byproduct of increased substantive agreement. Our results both refine and support the idea that deliberation, by increasing proximity to single-peakedness, provides an escape from the problem of majority cycling. (shrink)

Abstract: The analytical, comparative cross-sectional study was conducted to assess the thyroid profiles and modified lipid profiles levels among Sudanese patients with coronary heart disease performed on forty-one patients with coronary heart disease as test group collected from Sudan Heart Center, Al rebat teaching hospital and Al mawada hospital in Khartoum state, during the period between November 2017 and May 2018. Furthermore, the test group compared with forty-one apparently healthy volunteers as control group was selected with the same inclusion criteria. (...) Spectrophotometeric methods were used for measurement of lipid profile. Thyroid hormones (T3 &T4) and thyroid stimulating hormone were measured by using Sandwich Enzyme-Linked Immunosorbent Assay (ELISA). Moreover, statistical package for social science (SPSS version 23) computer software was used for data analysis. The study clearly demonstrated that there was statistically significant decrease in T3, and significant increase in T4 levels in test group compared to control with (P. value 0.047) for T3, and (P. value 0.002) for T4.Nonetheless, the result of this study indicated a significant elevation in mean of total cholesterol, low density lipoprotein-cholesterol levels and significant decrease in high density lipoprotein –cholesterol in test group compared to control (P.value 0.000). In conclusion Coronary heart diseases patients have significantly low Triiodothyronine, elevated Thyroxin, and normal Thyroid Stimulating Hormone levels, with significantly higher Total Cholesterol, Low Density Lipoprotein-Cholesterol concentrations, and lower HighDensity Lipoprotein-Cholesterol concentrations. (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 aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good (...) measure of the strength of the theory. I exhibit certain strong counterexamples and establish conclusively that the received view is false. Moreover, I show that the limiting constants provided by the theorem do not in any way reflect the power of formalized theories, but that the values of these constants are actually determined by the chosen coding of Turing machines, and are thus quite accidental. (shrink)

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for (...) “n = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

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)

The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum (...) contextuality. The relevant mathematical structure is Hilbert arithmetic in a wide sense, in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem. (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)

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)

Although written in Japanese, this article handles historical and technical survey of Gödel's incompleteness theorem thoroughly.

My aim in this paper is to explain what Condorcet’s jury theorem is, and to examine its central assumptions, its significance to the epistemic theory of democracy and its connection with Rousseau’s theory of general will. In the first part of the paper I will analyze an epistemic theory of democracy and explain how its connection with Condorcet’s jury theorem is twofold: the theorem is at the same time a contributing historical source, and the model used by (...) the authors to this day. In the second part I will specify the purposes of the theorem itself, and examine its underlying assumptions. Third part will be about an interpretation of Rousseau’s theory, which is given by Grofman and Feld relying on Condorcet’s jury theorem, and about criticisms of such interpretation. In the fourth, and last, part I will focus on one particular assumption of Condorcet’s theorem, which proves to be especially problematic if we would like to apply the theorem under real-life conditions; namely, the assumption that voters choose between two options only. (shrink)

Condorcet's famous jury theorem reaches an optimistic conclusion on the correctness of majority decisions, based on two controversial premises about voters: they are competent and vote independently, in a technical sense. I carefully analyse these premises and show that: whether a premise is justi…ed depends on the notion of probability considered; none of the notions renders both premises simultaneously justi…ed. Under the perhaps most interesting notions, the independence assumption should be weakened.

A survey of more philosophical applications of Gödel's incompleteness results.

Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...) verifiably. We consider a constructive interpretation of classical, Tarskian, truth, and of Goedel's reasoning, under which any formal system of Peano Arithmetic---classically accepted as the foundation of all our mathematical Languages---is verifiably complete in the above sense. We show how some paradoxical concepts of Quantum mechanics can, then, be expressed, and interpreted, naturally under a constructive definition of mathematical truth. (shrink)

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we (...) thereby provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (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.

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)

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)

I demonstrate that Bell's theorem is based on circular reasoning and thus a fundamentally flawed argument. It unjustifiably assumes the additivity of expectation values for dispersion-free states of contextual hidden variable theories for non-commuting observables involved in Bell-test experiments, which is tautologous to assuming the bounds of ±2 on the Bell-CHSH sum of expectation values. Its premises thus assume in a different guise the bounds of ±2 it sets out to prove. Once this oversight is ameliorated from Bell's argument (...) by identifying the impediment that leads to it and local realism is implemented correctly, the bounds on the Bell-CHSH sum of expectation values work out to be ±2√2 instead of ±2, thereby mitigating the conclusion of Bell's theorem. Consequently, what is ruled out by any of the Bell-test experiments is not local realism but the linear additivity of expectation values, which does not hold for non-commuting observables in any hidden variable theories to begin with. (shrink)

Bell’s theorem has fascinated physicists and philosophers since his 1964 paper, which was written in response to the 1935 paper of Einstein, Podolsky, and Rosen. Bell’s theorem and its many extensions have led to the claim that quantum mechanics and by inference nature herself are nonlocal in the sense that a measurement on a system by an observer at one location has an immediate effect on a distant entangled system. Einstein was repulsed by such “spooky action at a (...) distance” and was led to question whether quantum mechanics could provide a complete description of physical reality. In this paper I argue that quantum mechanics does not require spooky action at a distance of any kind and yet it is entirely reasonable to question the assumption that quantum mechanics can provide a complete description of physical reality. The magic of entangled quantum states has little to do with entanglement and everything to do with superposition, a property of all quantum systems and a foundational tenet of quantum mechanics. (shrink)

We note that a plural version of logicism about arithmetic is suggested by the standard reading of Hume's Principle in terms of `the number of Fs/Gs'. We lay out the resources needed to prove a version of Frege's principle in plural, rather than second-order, logic. We sketch a proof of the theorem and comment philosophically on the result, which sits well with a metaphysics of natural numbers as plural properties.

The following essay reconsiders the ontological and logical issues around Frege’s Basic Law (V). If focuses less on Russell’s Paradox, as most treatments of Frege’s Grundgesetze der Arithmetik (GGA)1 do, but rather on the relation between Frege’s Basic Law (V) and Cantor’s Theorem (CT). So for the most part the inconsistency of Naïve Comprehension (in the context of standard Second Order Logic) will not concern us, but rather the ontological issues central to the conflict between (BLV) and (CT). These (...) ontological issues are interesting in their own right. And if and only if in case ontological considerations make a strong case for something like (BLV) we have to trouble us with inconsistency and paraconsistency. These ontological issues also lead to a renewed methodological reflection what to assume or recognize as an axiom. (shrink)

Riker (1982) famously argued that Arrow’s impossibility theorem undermined the logical foundations of “populism”, the view that in a democracy, laws and policies ought to express “the will of the people”. In response, his critics have questioned the use of Arrow’s theorem on the grounds that not all configurations of preferences are likely to occur in practice; the critics allege, in particular, that majority preference cycles, whose possibility the theorem exploits, rarely happen. In this essay, I argue (...) that the critics’ rejoinder to Riker misses the mark even if its factual claim about preferences is correct: Arrow’s theorem and related results threaten the populist’s principle of democratic legitimacy even if majority preference cycles never occur. In this particular context, the assumption of an unrestricted domain is justified irrespective of the preferences citizens are likely to have. (shrink)

Fermat’s Least Time Principle has a long history. World’s foremost academies of the day championed by their most prestigious philosophers competed for the glory and prestige that went with the solution of the refraction problem of light. The controversy, known as Descartes - Fermat controversy was due to the contradictory views held by Descartes and Fermat regarding the relative speeds of light in different media. Descartes with his mechanical philosophy insisted that every natural phenomenon must be explained by mechanical principles. (...) Fermat on the other hand insisted an end purpose for every motion. For example, least time of travel and not the least distance of travel is the end purpose for motion of light. This implied a thinking nature, which was rejected by Descartes. Surprisingly, with contradictory assumptions regarding the relative speeds of light in different media, both Descartes and Fermat came to the same result that the ratio of sines of angles of incidence and refraction is a constant. Fermat’s result came to be known as the ‘Fermat’s least time principle’. We show in this article that Fermat’s least time principle violates a fundamental theorem in geometry – the Ptolemy’s theorem. That leads to the invalidity of Fermat’s principle. -/- . (shrink)

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing these (...) versions of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic. (shrink)

Leibniz proposed the ‘Most Determined Path Principle’ in seventeenth century. According to it, ‘ease’ of travel is the end purpose of motion. Using this principle and his calculus method he demonstrated Snell’s Laws of reflection and refraction. This method shows that light follows extremal (local minimum or maximum) time path in going from one point to another, either directly along a straight line path or along a broken line path when it undergoes reflection or refraction at plane or spherical (concave (...) or convex) surfaces. The extremal time path avoided the criticism that Fermat’s least time path was subjected to, by Cartesians who cited examples of reflections at spherical surfaces where light took the path of longest time. Thereby it became the standard method of demonstration of Snell’s Laws. Ptolemy’s theorem is a fundamental theorem in geometry. A special case of it offers a method of finding the minimum sum of the two distances of a point from two given fixed points. We show in this paper that Leibniz’s calculus proof of Snell’s Laws violates Ptolemy’s theorem, whereby Leibniz’s proof becomes invalid. (shrink)

In §8 of Remarks on the Foundations of Mathematics (RFM), Appendix 3 Wittgenstein imagines what conclusions would have to be drawn if the Gödel formula P or ¬P would be derivable in PM. In this case, he says, one has to conclude that the interpretation of P as “P is unprovable” must be given up. This “notorious paragraph” has heated up a debate on whether the point Wittgenstein has to make is one of “great philosophical interest” revealing “remarkable insight” in (...) Gödel’s proof, as Floyd and Putnam suggest (Floyd (2000), Floyd (2001)), or whether this remark reveals Wittgenstein’s misunderstanding of Gödel’s proof as Rodych and Steiner argued for recently (Rodych (1999, 2002, 2003), Steiner (2001)). In the following the arguments of both interpretations will be sketched and some deficiencies will be identified. Afterwards a detailed reconstruction of Wittgenstein’s argument will be offered. It will be seen that Wittgenstein’s argumentation is meant to be a rejection of Gödel’s proof but that it cannot satisfy this pretension. (shrink)

Georg Cantor's absolute infinity, the paradoxical Burali-Forti class Ω of all ordinals, is a monstrous non-entity for which being called a "class" is an undeserved dignity. This must be the ultimate vexation for mathematical philosophers who hold on to some residual sense of realism in set theory. By careful use of Ω, we can rescue Georg Cantor's 1899 "proof" sketch of the Well-Ordering Theorem––being generous, considering his declining health. We take the contrapositive of Cantor's suggestion and add Zermelo's choice (...) function. This results in a concise and uncomplicated proof of the Well-Ordering Theorem. (shrink)

In this essay a quantum-dualistic, perspectival and synchronistic interpretation of quantum mechanics is further developed in which the classical world-from-decoherence which is perceived (decoherence) and the perceived world-in-consciousness which is classical (collapse) are not necessarily identified. Thus, Quantum Reality or "{\it unus mundus}" is seen as both i) a physical non-perspectival causal Reality where the quantum-to-classical transition is operated by decoherence, and as ii) a quantum linear superposition of all classical psycho-physical perspectival Realities which are governed by synchronicity as well (...) as causality (corresponding to classical first-person observes who actually populate the world). This interpretation is termed the Nietzsche-Jung-Pauli interpretation and is a re-imagining of the Wigner-von Neumann interpretation which is also consistent with some reading of Bohr's quantum philosophy. (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)

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.

In spite of the many efforts made to clarify von Neumann’s methodology of science, one crucial point seems to have been disregarded in recent literature: his closeness to Hilbert’s spirit. In this paper I shall claim that the scientific methodology adopted by von Neumann in his later foundational reflections originates in the attempt to revaluate Hilbert’s axiomatics in the light of Gödel’s incompleteness theorems. Indeed, axiomatics continues to be pursued by the Hungarian mathematician in the spirit of Hilbert’s school. I (...) shall argue this point by examining four basic ideas embraced by von Neumann in his foundational considerations: a) the conservative attitude to assume in mathematics; b) the role that mathematics and the axiomatic approach have to play in all that is science; c) the notion of success as an alternative methodological criterion to follow in scientific research; d) the empirical and, at the same time, abstract nature of mathematical thought. Once these four basic ideas have been accepted, Hilbert’s spirit in von Neumann’s methodology of science will become clear. (shrink)

In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .

It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, (...) say, Delta-3-1 comprehension axioms are not logical truths. What I am going to suggest, however, is that there is a special case to be made on behalf of Pi-1-1 comprehension. Making the case involves investigating extensions of first-order logic that do not rely upon the presence of second-order quantifiers. A formal system for so-called "ancestral logic" is developed, and it is then extended to yield what I call "Arché logic". (shrink)

Introduction to mathematical logic. Part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.