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 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)

I set up two axiomatic theories of inductive support within the framework of Kolmogorovian probability theory. I call these theories ‘Popperian theories of inductive support’ because I think that their specific axioms express the core meaning of the word ‘inductive support’ as used by Popper (and, presumably, by many others, including some inductivists). As is to be expected from Popperian theories of inductive support, the main theorem of each of them is an anti-induction theorem, the stronger (...) one of them saying, in fact, that the relation of inductive support is identical with the empty relation. It seems to me that an axiomatic treatment of the idea(s) of inductive support within orthodox probability theory could be worthwhile for at least three reasons. Firstly, an axiomatic treatment demands from the builder of a theory of inductive support to state clearly in the form of specific axioms what he means by ‘inductive support’. Perhaps the discussion of the new anti-induction proofs of Karl Popper and David Miller would have been more fruitful if they had given an explicit definition of what inductive support is or should be. Secondly, an axiomatic treatment of the idea(s) of inductive support within Kolmogorovian probability theory might be accommodating to those philosophers who do not completely trust Popperian probability theory for having theorems which orthodox Kolmogorovian probability theory lacks; a transparent derivation of anti-induction theorems within a Kolmogorovian frame might bring additional persuasive power to the original anti-induction proofs of Popper and Miller, developed within the framework of Popperian probability theory. Thirdly, one of the main advantages of the axiomatic method is that it facilitates criticism of its products: the axiomatic theories. On the one hand, it is much easier than usual to check whether those statements which have been distinguished as theorems really are theorems of the theory under examination. On the other hand, after we have convinced ourselves that these statements are indeed theorems, we can take a critical look at the axioms—especially if we have a negative attitude towards one of the theorems. Since anti-induction theorems are not popular at all, the adequacy of some of the axioms they are derived from will certainly be doubted. If doubt should lead to a search for alternative axioms, sheer negative attitudes might develop into constructive criticism and even lead to new discoveries. -/- I proceed as follows. In section 1, I start with a small but sufficiently strong axiomatic theory of deductive dependence, closely following Popper and Miller (1987). In section 2, I extend that starting theory to an elementary Kolmogorovian theory of unconditional probability, which I extend, in section 3, to an elementary Kolmogorovian theory of conditional probability, which in its turn gets extended, in section 4, to a standard theory of probabilistic dependence, which also gets extended, in section 5, to a standard theory of probabilistic support, the main theorem of which will be a theorem about the incompatibility of probabilistic support and deductive independence. In section 6, I extend the theory of probabilistic support to a weak Popperian theory of inductive support, which I extend, in section 7, to a strong Popperian theory of inductive support. In section 8, I reconsider Popper's anti-inductivist theses in the light of the anti-induction theorems. I conclude the paper with a short discussion of possible objections to our anti-induction theorems, paying special attention to the topic of deductive relevance, which has so far been neglected in the discussion of the anti-induction proofs of Popper and Miller. (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)

Although we often see references to Carnap’s inductive logic even in modern literatures, seemingly its confusing style has long obstructed its correct understanding. So instead of Carnap, in this paper, I devote myself to its necessary and sufficient commentary. In the beginning part (Sections 2-5), I explain why Carnap began the study of inductive logic and how he related it with our thought on probability (Sections 2-4). Therein, I trace Carnap’s thought back to Wittgenstein’s Tractatus as well (Section (...) 5). In the succeeding sections, I attempt the simplest exhibition of Carnap’s earlier system, where his original thought was thoroughly provided. For this purpose, minor concepts to which researchers have not paid attention are highlighted, for example, m-function (Section 8), in-correlation (Section 10), C-correlate (Section 10), statistical distribution (Section 12), and fitting sequence (Section 17). The climax of this paper is the proof of theorem (56). Through this theorem, we will be able to overview Carnap’s whole system. (shrink)

This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and either (...) its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven. This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss's S12. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies. (shrink)

A textbook on proof in mathematics, inspired by an Aristotelian point of view on mathematics and proof. The book expounds the traditional view of proof as deduction of theorems from evident premises via obviously valid steps. It deals with the proof of "all" statements, "some" statements, multiple quantifiers and mathematical induction.

In attempt to provide an answer to the question of origin of deductive proofs, I argue that Aristotle’s philosophy of math is more accurate opposed to a Platonic philosophy of math, given the evidence of how mathematics began. Aristotle says that mathematical knowledge is a posteriori, known through induction; but once knowledge has become unqualified it can grow into deduction. Two pieces of recent scholarship on Greek mathematics propose new ways of thinking about how mathematics began in the Greek (...) culture. Both claimed there was a close relationship between the culture and mathematicians; mathematics was understood through imaginative processes, experiencing the proofs in tangible ways, and establishing a consistent unified form of argumentation. These pieces of evidence provide the context in which Aristotle worked and their contributions lend support to the argument that mathematical premises as inductively available is a better way of understanding the origins of deductive practices, opposed to the Platonic tradition. (shrink)

This paper offers a reconstruction of Wittgenstein's discussion on inductive proofs. A "algebraic version" of these indirect proofs is offered and contrasted with the usual ones in which an infinite sequence of modus pones is projected.

The problem of underdetermination is thought to hold important lessons for philosophy of science. Yet, as Kyle Stanford has recently argued, typical treatments of it offer only restatements of familiar philosophical problems. Following suggestions in Duhem and Sklar, Stanford calls for a New Induction from the history of science. It will provide proof, he thinks, of “the kind of underdetermination that the history of science reveals to be a distinctive and genuine threat to even our best scientific theories” (Stanford 2001, (...) p. S12). This paper examines Stanford’s New Induction and argues that it – like the other forms of underdetermination that he criticizes – merely recapitulates familiar philosophical conundra. (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)

In this chapter we introduce concepts for analyzing proofs, and for analyzing undergraduate and beginning graduate mathematics students’ proving abilities. We discuss how coordination of these two analyses can be used to improve students’ ability to construct proofs. -/- For this purpose, we need a richer framework for keeping track of students’ progress than the everyday one used by mathematicians. We need to know more than that a particular student can, or cannot, prove theorems by induction or contradiction (...) or can, or cannot, prove certain theorems in beginning set theory or analysis. It is more useful to describe a student’s work in terms of a finer-grained framework that includes various smaller abilities that contribute to proving and that can be learned in differing ways and at differing periods of a student’s development. (shrink)

Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully formalized and, further, that any formal system containing a modicum of number or set theory cannot establish its own consistency. Wilfried Sieg and Clinton Field, in their paper Automated Search for Gödel's Proofs, presented automated proofs of Gödel's theorems at an abstract axiomatic level; they used an appropriate expansion of the strategic considerations that guide the search of the automated theorem prover AProS. The representability conditions that (...) allow the syntactic notions of the metalanguage to be represented inside the object language were taken as axioms in the automated proofs. The concrete task I am taking on in this project is to extend the search by formally verifying these conditions. Using a formal metatheory defined in the language of binary trees, the syntactic objects of the metatheory lend themselves naturally to a direct encoding in Zermelo's theory of sets. The metatheoretic notions can then be inductively defined and shown to be representable in the object-theory using appropriate inductive arguments. Formal verification of the representability conditions is the first step towards an automated proof thereof which, in turn, brings the automated verification of Gödel's theorems one step closer to completion. (shrink)

For the last forty years, Hume's Newtonianism has been a debated topic in Hume scholarship. The crux of the matter can be formulated by the following question: Is Hume a Newtonian philosopher? Debates concerning this question have produced two lines of interpretation. I shall call them ‘traditional’ and ‘critical’ interpretations. The traditional interpretation asserts that there are many Newtonian elements in Hume, whereas the critical interpretation seriously questions this. In this article, I consider the main points made by both lines (...) of interpretations and offer further arguments that contribute to this debate. I shall first argue, in favor of the traditional interpretation, that Hume is sympathetic to many prominently Newtonian themes in natural philosophy such as experimentalism, criticality of hypotheses, inductive proof, and criticality of Leibnizian principles of sufficient reason and intelligibility. Second, I shall argue, in accordance with the critical interpretation, that in many cases Hume... (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, KT (...) , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

Opinionated state of the art paper on mathematical explanation. After a general introduction to the subject, the paper is divided into two parts. The first part is dedicated to intra-mathematical explanation and the second is dedicated to extra-mathematical explanation. Each of these parts begins to present a set of diverse problems regarding each type of explanation and, afterwards, it analyses relevant models of the literature. Regarding the intra-mathematical explanation, the models of deformable proofs, mathematical saliences and the demonstrative structure (...) of mathematical induction are addressed. Regarding the extra-mathematical explanation, modal, abstract and deductive models are addressed. (shrink)

The subject of this essay-based dissertation is Hume’s natural philosophy. The dissertation consists of four separate essays and an introduction. These essays do not only treat Hume’s views on the topic of natural philosophy, but his views are placed into a broader context of history of philosophy and science, physics in particular. The introductory section outlines the historical context, shows how the individual essays are connected, expounds what kind of research methodology has been used, and encapsulates the research contributions of (...) the essays. The first essay treats Newton’s experimentalist methodology in gravity research and its relation to Hume’s causal philosophy. It is argued that Hume does not see the relation of cause and effect as being founded on a priori reasoning, similar to the way in which Newton criticized non-empirical hypotheses about the causal properties of gravity. Contrary to Hume’s rules of causation, the universal law does not include a reference either to contiguity or succession, but Hume accepts it in interpreting the force and the law of gravity instrumentally. The second article considers Newtonian and non-Newtonian elements in Hume more broadly. He is sympathetic to many prominently Newtonian themes in natural philosophy, such as experimentalism, critique of hypotheses, inductive proof, and the critique of Leibnizian principles of sufficient reason and intelligibility. However, Hume is not a Newtonian philosopher in many respects: his conceptions regarding space and time, the vacuum, the specifics of causation, the status of mechanism, and the reality of forces differ markedly from Newton’s related conceptions. The third article focuses on Hume’s Fork and the proper epistemic status of propositions of mixed mathematics. It is shown that the epistemic status of propositions of mixed mathematics, such as those concerning laws of nature, is that of matters of fact. The reason for this is that the propositions of mixed mathematics are dependent on the Uniformity Principle. The fourth article analyzes Einstein’s acknowledgement of Hume regarding special relativity. The views of the scientist and the philosopher are juxtaposed, and it is argued that there are two common points to be found in their writings, namely an empiricist theory of ideas and concepts and a relationist ontology regarding space and time. (shrink)

Inductively defined structures are ubiquitous in mathematics; their specification is unambiguous and their properties are powerful. All fields of mathematical logic feature these structures prominently: the formula of a language, the set of theorems, the natural numbers, the primitive recursive functions, the constructive number classes and segments of the cumulative hierarchy of sets. -/- This dissertation gives a mathematical characterization of a species of inductively defined structures, called accessible domains, which include all of the above examples except the set of (...) theorems. The concept of an accessible domain comes from Wilfried Sieg's analysis of proof-theoretic practices, starting with his dissertation. In particular, he noticed the special epistemological character of elements of an accessible domain: they can always be uniquely identified with their build-up. Generally, the unique build-up of elements justifies the principles of induction and recursion. -/- I use category theory to give an abstract characterization of accessible domains. I claim that accessible domains are all instances of initial algebras for endofunctors. Grounded in the historical roots of Sieg's discussions, this dissertation shows how the properties of initial algebras for endofunctors and accessible domains coincide in a satisfying and natural way. -/- Filling out this characterization, I show how important examples of accessible domains fit into this broad characterization. I first characterize some accessible domains by relatively simple functors (e.g. finite, polynomial, those that preserve certain colimits) where we can see how iterating the functor can produce the accessible domain. Then I describe accessible domains that result from more involved specifications (e.g. ordinals and segments of the cumulative hierarchies associated with CZF, IZF, and ZF) by relying heavily on algebraic set theory. I end with a discussion of some of the methodological features of category theory in particular that helped characterize accessible domains. (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)

Animal welfare scientists face an acute version of the problem of inductive risk, since they must choose whether to affirm attributions of mental states to animals in advisory contexts, knowing their decisions hold consequences for animal welfare. In such contexts, the burden of proof should be sensitive to the consequences of error, but a framework for setting appropriate burdens of proof is lacking. Through reflection on two cases—pain and cognitive enrichment—I arrive at a tentative framework based on the principle (...) of expected welfare maximization. I then discuss the limitations of this framework and the questions it leaves open. (shrink)

This paper considers Rumfitt’s bilateral classical logic (BCL), which is proposed to counter Dummett’s challenge to classical logic. First, agreeing with several authors, we argue that Rumfitt’s notion of harmony, used to justify logical rules by a purely proof theoretical manner, is not sufficient to justify coordination rules in BCL purely proof-theoretically. For the central part of this paper, we propose a notion of proof-theoretical validity similar to Prawitz for BCL and proves that BCL is sound and complete respect to (...) this notion of validity. The major difficulty in defining validity for BCL is that validity of positive +A appears to depend on negative −A, and vice versa. Thus, the straightforward inductive definition does not work because of this circular dependance. However, Knaster-Tarski’s fixed point theorem can resolve this circularity. Finally, we discuss the philosophical relevance of our work, in particular, the impact of the use of fixed point theorem and the issue of decidability. (shrink)

In this paper, I argue that, other things being equal, simpler arguments are better. In other words, I argue that, other things being equal, it is rational to prefer simpler arguments over less simple ones. I sketch three arguments in support of this claim: an argument from mathematical proofs, an argument from scientific theories, and an argument from the conjunction rule.

A principle, according to which any scientific theory can be mathematized, is investigated. Social science, liberal arts, history, and philosophy are meant first of all. That kind of theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather (...) a metamathematical axiom about the relation of mathematics and reality. The main statement is formulated as follows: Any scientific theory admits isomorphism to some mathematical structure in a way constructive. Its investigation needs philosophical means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. The sketch of the proof is organized in five steps: a generalization of epoché; involving transfinite induction in the transition between Peano arithmetic and set theory; discussing the finiteness of Peano arithmetic; applying transfinite induction to Peano arithmetic; discussing an arithmetical model of reality. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. The present paper follows a pathway grounded on Husserl’s phenomenology and “bracketing reality” to achieve the generalized arithmetic necessary for the principle to be founded in alternative ontology, in which there is no reality external to mathematics: reality is included within mathematics. That latter mathematics is able to self-found itself and can be called Hilbert mathematics in honour of Hilbert’s program for self-founding mathematics on the base of arithmetic. The principle of universal mathematizability is consistent to Hilbert mathematics, but not to Gödel mathematics. Consequently, its validity or rejection would resolve the problem which mathematics refers to our being; and vice versa: the choice between them for different reasons would confirm or refuse the principle as to the being. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. The Schrödinger equation in quantum mechanics is involved to illustrate that ontology. Thus the problem which of the two mathematics is more relevant to our being is discussed again in a new way A few directions for future work can be: a rigorous formal proof of the principle as an independent axiom; the further development of information ontology consistent to both kinds of mathematics, but much more natural for Hilbert mathematics; the development of the information interpretation of quantum mechanics as a mathematical one for information ontology and thus Hilbert mathematics; the description of consciousness in terms of information ontology. (shrink)

A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...) means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. A comparison to Mach’s doctrine is used to be revealed the fundamental and philosophical reductionism of Husserl’s phenomenology leading to a kind of Pythagoreanism in the final analysis. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. Thus the problem which of the two mathematics is more relevant to our being is discussed. An information interpretation of the Schrödinger equation is involved to illustrate the above problem. (shrink)

A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been criticized for (...) using that rule in attempting to show that arithmetic equations are consequences of definitions. -/- A system of deductions is truth-preserving if each of its deductions having true premises has a true conclusion—and consequence-preserving if, for any given set of sentences, each deduction having premises that are consequences of that set has a conclusion that is a consequence of that set. Consequence-preserving amounts to: in each of its deductions the conclusion is a consequence of the premises. The same definitions apply to deduction rules considered as systems of deductions. Every consequence-preserving system is truth-preserving. It is not as well-known that the converse fails: not every truth-preserving system is consequence-preserving. Likewise for rules: not every truth-preserving rule is consequence-preserving. There are many famous examples. In ordinary first-order Peano-Arithmetic, the induction rule yields the conclusion ‘every number x is such that: x is zero or x is a successor’—which is not a consequence of the null set—from two tautological premises, which are consequences of the null set, of course. The arithmetic induction rule is truth-preserving but not consequence-preserving. Truth-preserving rules that are not consequence-preserving are non-logical or extra-logical rules. Such rules are unacceptable to persons espousing traditional truth-and-consequence conceptions of demonstration: a demonstration shows its conclusion is true by showing that its conclusion is a consequence of premises already known to be true. The 1965 Preface in Benson Mates (1972, vii) contains the first occurrence of truth-preservation fallacies in the book. (shrink)

In a recent paper by Tranchini (Topoi, 2019), an introduction rule for the paradoxical proposition ρ∗ that can be simultaneously proven and disproven is discussed. This rule is formalized in Martin-Löf’s constructive type theory (CTT) and supplemented with an inferential explanation in the style of Brouwer-Heyting-Kolmogorov semantics. I will, however, argue that the provided formalization is problematic because what is paradoxical about ρ∗ from the viewpoint of CTT is not its provability, but whether it is a proposition at all.

This book researches the thought of Jin Yuelin’s epistemology with some notions and methods of contemporary epistemology as the frame of reference. There are two kinds of academical significance in this book, one is that author has accurately comprehended the specific content, inadequacies and contradictions in Jin’ s epistemology, recognized the methods by which Jin Yuelin built his theory of knowledge. The other is that author has known about the differences in research objects and methods between Jin’s theory and contemporary (...) epistemology, and showed the position of Jin’s epistemology in the whole theory of knowledge through the comparative study. On the one hand, the book focuses on the core problem of Jin Yuelin’ epistemology that is how objective knowledge is produced. On the other hand, it is made up of seven chapters in accordance with the structure of Jin’s Theory of Knowledge. The first chapter introduces and comparatively analyzes the comprehensions about the concepts of “knowledge” and “epistemology” between Jin Yuelin and contemporary epistemologists. This chapter supplies the means and methods for following chapters. The second chapter describes Jin’s standpoint and criticism to idealism starting mode, analyzes the objective starting mode that belongs to Jin’s theory and reveals his negative attitude to skepticism. This chapter shows the essential characteristics of the Jin Yuelin’s epistemology. The given is the content of sensation, which is the most basic part of cognitive activity. Moreover Jin Yuelin regards sensation as foundation of knowledge, so the research on theory of the given is separated from the whole study of cognitive activity and treated as the third chapter, which presents Jin’s theory of the given and analyzes the problems of Jin’s theory, then introduces some kinds of theory of the given and theory of perception in the contemporary epistemology, finally comparatively investigates theories of the given between Jin Yuelin and contemporary epistemologists. From the perspective of cognitive activity, the fourth chapter describes the perceptual activity, the activity of knowing, the activity of thinking, means and outlines of reception in Jin’s epistemology, then exposes its contradictions and inadequacies; Induction is the important research object of the Western epistemologists, similarly Jin Yuelin paid more attention to induction and regards the principle of induction as outline of reception. In fact, his standpoint about the principle of induction is vital and creative, so the study of induction separately belongs to the fifth chapter. This chapter presents the Jin’s comprehension about the principle of induction and some answers to the problem of induction in contemporary epistemology, then comparatively analyzes two kinds of the thought about induction. The sixth chapter successively introduces being, nature and fact which all are objects of cognitive activity, then analyzes the problems within them. From the perspective of cognitive results, the last chapter presents the Jin’s standpoint about verification and demonstration of proposition, definition and criteria of truth, then simply describes the point views of contemporary epistemologists about verification and truth of proposition, finally comparatively investigates two kinds of thought. From the vertical, the thesis analyzes the fundamental sections of objective knowledge one by one, such as the given, experience, idea, proposition and truth. From the horizontal, the book focuses on the three main parts of knowledge event, for example, cognitive activity, objects of knowledge and the true proposition treated as knowledge. In a word, the whole book is coherent and organic unity. Through the comparative study, it can be concluded that it is reasonable for Jin Yuelin to enjoy a high academic status, because he is the first philosopher who specializes in the study of epistemology. At the same times, he improves transmission of logic, metaphysics and epistemology from the Western to China. So, his hard work enriches and expands the realm of Chinese philosophy. With the development of the study of epistemology, descriptive content of it, such as, perceptual activity and rational activity, will be regarded as the objects of psychology and cognitive science. Meanwhile, normative content will be retained. For example, analysis of conditions of knowledge, justification for belief claims, comprehension about the proofs of justification, as well as reactions to challenges of skepticism. The latter will continue to be objects of epistemology, of course, they must establish close relationships with psychology and cognitive science. According to this prospect, we should split Jin Yuelin’s theory of knowledge, of which the descriptive content would be allocated to psychology and cognitive science. On the contrary, the normative content would be kept as important resource for deeply studying epistemology. -/- Key words: Knowledge; Contemporary epistemology; Compare; The given; Idea; The principle of induction; Fact. (shrink)

This paper analyzes the incisive counter-arguments against Gaṅgeśa’s defense of non-conceptual perception offered by the Dvaita Vedānta scholar Vyāsatīrtha in his Destructive Dance of Dialectic. The details of Vyāsatīrtha’s arguments have gone largely unnoticed by subsequent Navya Nyāya thinkers, as well as by contemporary scholars engaged in a debate over the role of non-conceptual perception in Nyāya epistemology. Vyāsatīrtha thoroughly undercuts the inductive evidence supporting Gaṅgeśa’s main inferential proof of non-conceptual perception, and shows that Gaṅgeśa has no basis for (...) thinking that non-conceptual perception has any necessary causal role in generating concept-laden perceptual awareness. He further raises a number of internal inconsistencies and undesirable consequences for Gaṅgeśa’s claim that non-conceptual states are introspectively invisible. His own causal theory of perception is more parsimonious than the Nyāya account, and is equally compatible with direct realism. I conclude by noting several striking parallels between Vyāsatīrtha’s views and the conceptualism of John McDowell, while also suggesting that Vyāsatīrtha's own conceptualism is not unduly constrained by some of McDowell’s limiting assumptions about concepts and perceptual contents. (shrink)

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...) involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

Aristotle’s points about circle and vicious circle are as follows: 1. Aristotle criticizes some thinkers because ‘they see no difficulty in holding that all truths are demonstrated, on the ground that demonstration may be circular and reciprocal.’ (PsA., A, 3, 72b16-18) 2. ‘Not all knowledge is demonstrative’ and ‘knowledge of the immediate premises is independent of demonstration.’ Aristotle brings two reasons for this: ‘Since we must know the prior premises from which the demonstration is drawn, and since the regress must (...) end in immediate truths, those truths must be indemonstrable.’ (PsA., A, 3, 72b18-22) 3. Demonstration in the unqualified sense cannot be circular: ‘Demonstration must be based on premises prior to and better known than the conclusion; and the same things cannot simultaneously be both prior and posterior to one another: so circular demonstration is clearly not possible in the unqualified sense of demonstration, but only possible if ‘demonstration be extended to include that other method of argument which rests on a distinction between truths prior to us and truths without qualification prior, i.e. the method by which induction produces knowledge. But if we accept this extension of meaning, our definition of unqualified knowledge will prove faulty; for there seem to be two kinds of it. Perhaps, however, the second form of demonstration, that which proceeds from truths better known to us, is not demonstration in the unqualified sense of the term.’ (PsA., A, 3, 72b23-32) 4. The theory of circular demonstration ‘reduces to the mere statement that if a thing exists, then it does exist- an easy way of providing anything.’ (psA., A, 3, 72b32-34) 5. ‘To constitute the circle it makes no difference whether many terms or few or even only one is taken. Thus by direct proof, if A is, B must be; if B is, C must be; therefore, if A is, C must be. Since then- by the circular proof- if A is, B must be, and if B is, A must be. A may be substituted for C above. Then ‘if B is, A must be’ = ‘if B is, C must be.’ But C and A have been identified. Consequently, the upholders of circular demonstration are in the position of saying that if A is, A must be- a simple way of proving anything. Moreover, even such circular demonstration is impossible except in the case of attributes that imply one another, viz. ‘peculiar’ properties.’ (PsA, A, 3, 72b34-73a7) . (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)

This paper contains five observations concerning the intended meaning of the intuitionistic logical constants: (1) if the explanations of this meaning are to be based on a non-decidable concept, that concept should not be that of `proof"; (2) Kreisel"s explanations using extra clauses can be significantly simplified; (3) the impredicativity of the definition of → can be easily and safely ameliorated; (4) the definition of → in terms of `proofs from premises" results in a loss of the inductive (...) character of the definitions of ∨ and ∃ and (5) the same occurs with the definition of ∀ in terms of `proofs with free variables". (shrink)

This book presents and analyzes the most important arguments in the history of Western philosophy's skeptical tradition. It demonstrates that, although powerful, these arguments are quite limited and fail to prove their core assertion that knowledge is beyond our reach. Argues that skepticism is mistaken and that knowledge is possible Dissects the problems of realism and the philosophical doubts about the accuracy of the senses Explores the ancient argument against a criterion of knowledge, Descartes' skeptical arguments, and skeptical arguments applied (...) to inductive inference and self-knowledge Uses Moore's proof of an external world and the reliabilist conception of knowledge to illustrate that the traditional skeptical arguments fail to meet their mark. (shrink)

Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally two (...) types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

Why should one think Frege's definition of the ancestral correct? It can be proven to be extensionally correct, but the argument uses arithmetical induction, and that seems to undermine Frege's claim to have justified induction in purely logical terms. I discuss such circularity objections and then offer a new definition of the ancestral intended to be intensionally correct; its extensional correctness then follows without proof. This new definition can be proven equivalent to Frege's without any use of arithmetical induction. This (...) proves, without any use of arithmetical induction, that Frege's definition is extensionally correct and so answers the circularity objections. (shrink)

Interest in the nature of religious and mystical experiences (henceforth RMEs) is old. Recently, this interest has shifted toward understanding the relationship between brain function and RMEs. In the first section, I introduce neurocognitive data from three experiments that strongly correlate the report of religious mystical experiences with specific neural activity. Although correlations cannot be considered as “absolute” proof, strong correlations provide us with inductive grounds for justifying the belief or nonbelief of some proposition. These data suggest that the (...) human brain plays a key role in having an RME and will provide support for the claim that our explanations for phenomena should be located in the natural world. In the next section, I explore the meaning of an RME from a Jamesian perspective and discuss the use of RMEs and the apparent design of the world as proof for God’s existence. My point is to show that the whole enterprise of using phenomena “that only God could have brought about” as the proof for God’s existence is inherently question begging and so is no proof that God exists. In the third section, I lay out in detail my assumptions for my main argument in the final section. There, I argue that belief in the supernatural is not justifiable given the data we have from contemporary science and basic rules of reasoning. (shrink)

In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...) in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (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)

There are at least two discussions about Pythagoreans in Aristotle’s works that can be related to paradigm, both in Book A of Metaphysics. In the first, Aristotle says that for Pythagoreans all the things are modeled after numbers (τὰ μὲν ἄλλα τοῖς ἀριθμοῖς ἐφαίνετο τὴν φύσιν ἀφωμοιῶσθαι πᾶσιν). (Met., A, 985b32-33) In the second, Aristotle tells us that Pythagoreans take ‘the first subject of which a given term would be predicable (ᾧ πρώτῳ ὑπάρξειεν ὁ λεχθεὶς ὃρος)’ as the substance of (...) the thing. His example is double and two: since two is the first thing of which double is predicated, double will be the substance of two. (Met., A, 987a22-25) 1) Forms as paradigms Some of the critiques of platonic Forms in Aristotle’s works are paradigm-oriented: they attack Plato’s theory on the basis that Platonians considered Forms as paradigms. The core of all Aristotle’s objections is that calling Forms paradigms is a mere poetical strategy and does not have any real effect. (Met., 991a20-22; M, 1079b24-26) We can recognize four reasons for Aristotle’s objections of forms as paradigms: a) To consider something as the paradigm of another thing to which it is like does not have any ontological effect: ‘For what it is that works, looking to the ideas? Anything can either be, or become, like another without being copied from it, so that whether Socrates exists or not a man might come to be like Socrates.’ (Met., A, 991a22-26; M, 1079b26-29) Therefore, paradigms are ontologically unnecessary: ‘It is quite unnecessary to set up a form as a paradigm … the begetter is adequate to the making of the product and the causing of the form in the matter.’ (Met., Z, 1034a2-5) Don’t these cases imply that Aristotle did have more the ontological necessity of paradigm in thought instead of its epistemological necessity? b) To consider Forms as paradigms means that a thing must have several paradigms; e.g. animal and too-footed and man will be paradigms of the same thing. (Met., A, 991a27-29; M, 1079b31-33) c) The theory that Forms are paradigms not only of sensible things but also of themselves makes the same thing both a paradigm and a copy (ἐικών). (Met., A, 991a29-b1; M, 1079b33-35) 2) Reasoning by paradigm Aristotle compares the arguments using paradigms to his own theory of syllogism: ‘We have an ‘example’ (παράδειγμα) when the major term is proved to belong to the middle by means of a term which resembles the third. It ought to be known that the middle belongs to the third term, and that the first belongs to that which resembles the third. For example, let A be evil, B making war against neighbors, C Athenians against Thebians, D Thebians against Phocians. If then we wish to prove that to fight against Thebians is an evil, we must assume that to fight against neighbors is an evil. Evidence of this is obtained from similar cases, e.g. that the war against the Phocians was an evil to Thebians. …Now it is clear that B belongs to C and to D (for both are cases of making war upon one’s neighbors) and that A belongs to D (for the war against the Phocians did not turn out well for the Thebians); but that A belongs to B will be proved through D.’ (PsA., B, 24, 66b38-69a11) An ‘example’ can also be made by several similar cases. (PrA., B, 24, 69a11-13) Aristotle notes (PrA., B, 24, 69a13-24) that reasoning by paradigm is ‘neither like reasoning from part to whole nor like reasoning from whole to part but is rather a reasoning from part to part, when both particulars are subordinate to the same term, and one of them is known.’ And it differs from induction in two ways: a) While induction uses all the particular cases to prove that the major term belongs to the middle, reasoning by paradigm does not draw its proof from all the particular cases. b) While induction does not apply the syllogistic conclusion to the minor term, reasoning by paradigm does make this application. (PrA., B, 24, 69a13-24) . (shrink)

By formalizing some classical facts about provably total functions of intuitionistic primitive recursive arithmetic (iPRA), we prove that the set of decidable formulas of iPRA and of iΣ1+ (intuitionistic Σ1-induction in the language of PRA) coincides with the set of its provably ∆1-formulas and coincides with the set of its provably atomic formulas. By the same methods, we shall give another proof of a theorem of Marković and De Jongh: the decidable formulas of HA are its provably ∆1-formulas.

Three qualities of “The Argument from Human Behavior” make it superior to other arguments for God. First, this argument discovers a universal indirect perception of God that everyone has many times every day: the fact that we all take seriously our sense of “wrong” (our sense of everyone’s moral obligations). Second, this argument reveals that the Biblical God claims He is the legislator of the moral laws in our mind. Third, it understands that discovering God will always demand a step (...) of faith, making an objective proof of God unattainable. However, the fact that we all have indirect perceptions of God produces the extreme probability, and possibly the inductive certainty: God exists. -/- Only God is able to enforce our inborn normative value of "wrong" and thereby keep it from being an unenforced absurdity. Since no one acts as if his or her sense of "wrong" is an absurdity, everyone behaves as if God exists. -/- This book also reveals that if the Biblical God exists, a slam-dunk rationale for His existence also must exist! No one will protest God’s judgment by saying that it was impossible to achieve the certainty that God exists. -/- Further, it contains innovative analyses of the major objections to God, including the Problem of Evil, Objective Morality, Euthyphro's Dilemma and the Philosophy of Science. (shrink)

Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness results as to Peano arithmetic. Quantum mechanics involves infinity by Hilbert space, but it is finitist as any experimental science. The absence of hidden variables in it interpretable as its completeness should resurrect Hilbert’s finitism at the cost of relevant modification of the latter already hinted by intuitionism and Gentzen’s approaches for completeness. This paper (...) investigates both conditions and philosophical background necessary for that modification. The main conclusion is that the concept of infinity as underlying contemporary mathematics cannot be reduced to a single Peano arithmetic, but to at least two ones independent of each other. Intuitionism, quantum mechanics, and Gentzen’s approaches to completeness an even Hilbert’s finitism can be unified from that viewpoint. Mathematics may found itself by a way of finitism complemented by choice. The concept of information as the quantity of choices underlies that viewpoint. Quantum mechanics interpretable in terms of information and quantum information is inseparable from mathematics and its foundation. (shrink)

Should we use the same standard of proof to adjudicate guilt for murder and petty theft? Why not tailor the standard of proof to the crime? These relatively neglected questions cut to the heart of central issues in the philosophy of law. This paper scrutinises whether we ought to use the same standard for all criminal cases, in contrast with a flexible approach that uses different standards for different crimes. I reject consequentialist arguments for a radically flexible standard of proof, (...) instead defending a modestly flexible approach on non-consequentialist grounds. The system I defend is one on which we should impose a higher standard of proof for crimes that attract more severe punishments. This proposal, although apparently revisionary, accords with a plausible theory concerning the epistemology of legal judgments and the role they play in society. (shrink)

In mathematics, any form of probabilistic proof obtained through the application of a probabilistic method is not considered as a legitimate way of gaining mathematical knowledge. In a series of papers, Don Fallis has defended the thesis that there are no epistemic reasons justifying mathematicians’ rejection of probabilistic proofs. This paper identifies such an epistemic reason. More specifically, it is argued here that if one adopts a conception of mathematical knowledge in which an epistemic subject can know a mathematical (...) proposition based solely on a probabilistic proof, one is then forced to admit that such an epistemic subject can know several lottery propositions based solely on probabilistic evidence. Insofar as knowledge of lottery propositions on the basis of probabilistic evidence alone is denied by the vast majority of epistemologists, it is concluded that this constitutes an epistemic reason for rejecting probabilistic proofs as a means of acquiring mathematical knowledge. (shrink)

In ‘Induction and Natural Kinds’, I proposed a solution to the problem of induction according to which our use of inductive inference is reliable because it is grounded in the natural kind structure of the world. When we infer that unobserved members of a kind will have the same properties as observed members of the kind, we are right because all members of the kind possess the same essential properties. The claim that the existence of natural kinds is what (...) grounds reliable use of induction is based on an inference to the best explanation of the success of our inductive practices. As such, the argument for the existence of natural kinds employs a form of ampliative inference. But induction is likewise a form of ampliative inference. Given both of these facts, my account of the reliability of induction is subject to the objection that it provides a circular justification of induction, since it employs an ampliative inference to justify an ampliative inference. In this paper, I respond to the objection of circularity by arguing that what justifies induction is not the inference to the best explanation of its reliability. The ground of induction is the natural kinds themselves. (shrink)

I review prominent historical arguments against scientific realism to indicate how they display a systematic overshooting in the conclusions drawn from the historical evidence. The root of the overshooting can be located in some critical, undue presuppositions regarding realism. I will highlight these presuppositions in connection with both Laudan’s ‘Old induction’ and Stanford’s New induction, and then delineate a minimal realist view that does without the problematic presuppositions.

Views which deny that there are necessary connections between distinct existences have often been criticized for leading to inductive skepticism. If there is no glue holding the world together then there seems to be no basis on which to infer from past to future. However, deniers of necessary connections have typically been unconcerned. After all, they say, everyone has a problem with induction. But, if we look at the connection between induction and explanation, we can develop the problem of (...) induction in a way that hits deniers of necessary connections, but not their opponents. The denier of necessary connections faces an `internal' problem with induction -- skepticism about important inductive inferences naturally flows from their position in a way that it doesn't for those who accept necessary connections. This is a major problem, perhaps a fatal one, for the denial of necessary connections. (shrink)

How induction was understood took a substantial turn during the Renaissance. At the beginning, induction was understood as it had been throughout the medieval period, as a kind of propositional inference that is stronger the more it approximates deduction. During the Renaissance, an older understanding, one prevalent in antiquity, was rediscovered and adopted. By this understanding, induction identifies defining characteristics using a process of comparing and contrasting. Important participants in the change were Jean Buridan, humanists such as Lorenzo Valla and (...) Rudolph Agricola, Paduan Aristotelians such as Agostino Nifo, Jacopo Zabarella, and members of the medical faculty, writers on philosophy of mind such as the Englishman John Case, writers of reasoning handbooks, and Francis Bacon. (shrink)

In this paper, I propose that applying the methods of data science to “the problem of whether mathematical explanations occur within mathematics itself” (Mancosu 2018) might be a fruitful way to shed new light on the problem. By carefully selecting indicator words for explanation and justification, and then systematically searching for these indicators in databases of scholarly works in mathematics, we can get an idea of how mathematicians use these terms in mathematical practice and with what frequency. The results of (...) this empirical study suggest that mathematical explanations do occur in research articles published in mathematics journals, as indicated by the occurrence of explanation indicators. When compared with the use of justification indicators, however, the data suggest that justifications occur much more frequently than explanations in scholarly mathematical practice. The results also suggest that justificatory proofs occur much more frequently than explanatory proofs, thus suggesting that proof may be playing a larger justificatory role than an explanatory role in scholarly mathematical practice. (shrink)

Aristotle said that induction (epagōgē) is a proceeding from particulars to a universal, and the definition has been conventional ever since. But there is an ambiguity here. Induction in the Scholastic and the (so-called) Humean tradition has presumed that Aristotle meant going from particular statements to universal statements. But the alternate view, namely that Aristotle meant going from particular things to universal ideas, prevailed all through antiquity and then again from the time of Francis Bacon until the mid-nineteenth century. Recent (...) scholarship is so steeped in the first-mentioned tradition that we have virtually forgotten the other. In this essay McCaskey seeks to recover that alternate tradition, a tradition whose leading theoreticians were William Whewell, Francis Bacon, Socrates, and in fact Aristotle himself. The examination is both historical and philosophical. The first part of the essay fills out the history. The latter part examines the most mature of the philosophies in the Socratic tradition, specifically Bacon’s and Whewell’s. After tracing out this tradition, McCaskey shows how this alternate view of induction is indeed employed in science, as exemplified by several instances taken from actual scientific practice. In this manner, McCaskey proposes to us that the Humean problem of induction is merely an artifact of a bad conception of induction and that a return to the Socratic conception might be warranted. (shrink)