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

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)

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

In this paper, the relationship between the e-value of a complex hypothesis, H, and those of its constituent elementary hypotheses, Hj, j = 1… k, is analyzed, in the independent setup. The e-value of a hypothesis H, ev, is a Bayesian epistemic, credibility or truth value defined under the Full Bayesian Significance Testing mathematical apparatus. The questions addressed concern the important issue of how the truth value of H, and the truth function of the corresponding FBST structure M, relate (...) to the truth values of its elementary constituents, Hj, and to the truth functions of their corresponding FBST structures Mj, respectively. (shrink)

This paper responds to recent work in the philosophy of Homotopy Type Theory by James Ladyman and Stuart Presnell. They consider one of the rules for identity, path induction, and justify it along ‘pre-mathematical’ lines. I give an alternate justification based on the philosophical framework of inferentialism. Accordingly, I construct a notion of harmony that allows the inferentialist to say when a connective or concept is meaning-bearing and this conception unifies most of the prominent conceptions of harmony through (...) category theory. This categorical harmony is stated in terms of adjoints and says that any concept definable by iterated adjoints from general categorical operations is harmonious. Moreover, it has been shown that identity in a categorical setting is determined by an adjoint in the relevant way. Furthermore, path induction as a rule comes from this definition. Thus we arrive at an account of how path induction, as a rule of inference governing identity, can be justified on mathematically motivated grounds. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (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 (...) class='Hi'>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 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)

I examine Du Châtelet’s methodology for physics and metaphysics through the lens of her engagement with Newton’s Rules for Reasoning in Natural Philosophy. I first show that her early manuscript writings discuss and endorse these Rules. Then, I argue that her famous published account of hypotheses continues to invoke close analogues of Rules 3 and 4, despite various developments in her position. Once relevant experimental evidence and some basic constraints are met, it is legitimate to inductively generalize from observations; general (...) hypotheses can thereafter be assumed as true until contrary experiments show otherwise. I conclude by arguing that this account of induction plays an essential role in her metaphysics, both in an argument for simple substances—which has an inductive premise—and in her attempt to distinguish acceptable and unacceptable metaphysical commitments. (shrink)

If the total state of the universe is encodable by a real number, Hardin and Taylor have proved that there is a solution to one version of the problem of induction, or at least a solution to a closely related epistemological problem. Is this philosophical application of the Hardin-Taylor result modest enough? The paper advances grounds for doubt. [A longer and more detailed sequel to this paper, 'Proving Induction', was published in the Australasian Journal of Logic in 2011.].

Nickles (2017) advocates scientific antirealism by appealing to the pessimistic induction over scientific theories, the illusion hypothesis (Quoidbach, Gilbert, and Wilson, 2013), and Darwin’s evolutionary theory. He rejects Putnam’s (1975: 73) no-miracles argument on the grounds that it uses inference to the best explanation. I object that both the illusion hypothesis and evolutionary theory clash with the pessimistic induction and with his negative attitude towards inference to the best explanation. I also argue that Nickles’s positive philosophical theories are (...) subject to Park’s (2017a) pessimistic induction over antirealists. (shrink)

The article evaluates the Domain Postulate of the Classical Model of Science and the related Aristotelian prohibition rule on kind-crossing as interpretative tools in the history of the development of mathematics into a general science of quantities. Special reference is made to Proclus’ commentary to Euclid’s first book of Elements , to the sixteenth century translations of Euclid’s work into Latin and to the works of Stevin, Wallis, Viète and Descartes. The prohibition rule on kind-crossing formulated by Aristotle (...) in Posterior analytics is used to distinguish between conceptions that share the same name but are substantively different: for example the search for a broader genus including all mathematical objects; the search for a common character of different species of mathematical objects; and the effort to treat magnitudes as numbers. (shrink)

Applying good inductive rules inside the scope of suppositions leads to implausible results. I argue it is a mistake to think that inductive rules of inference behave anything like 'inference rules' in natural deduction systems. And this implies that it isn't always true that good arguments can be run 'off-line' to gain a priori knowledge of conditional conclusions.

[EDIT: This book will be published open access. Check back around April 2024 to access the entire book.] One central aim of science is to provide explanations of natural phenomena. What role(s) does mathematics play in achieving this aim? How does mathematics contribute to the explanatory power of science? Rules to Infinity defends the thesis, common though perhaps inchoate among many members of the Vienna Circle, that mathematics contributes to the explanatory power of science by expressing conceptual rules, rules which (...) allow the transformation of empirical descriptions. Mathematics should not be thought of as describing, in any substantive sense, an abstract realm of eternal mathematical objects, as traditional platonists have thought. In Rules to Infinity, this view, which I call mathematical normativism, is updated with contemporary philosophical tools, and it is argued that normativism is compatible with mainstream semantic theory. This allows the normativist to accept that there are mathematical truths, while resisting the platonistic idea that there exist abstract mathematical objects that explain such truths. Furthermore, Rules to Infinity defends a particular account of the distinction between scientific explanations that are in some sense distinctively mathematical – those that explain natural phenomena in some uniquely mathematical way – and those that are only standardly mathematical, and it lays out desiderata for any account of this distinction. Normativism is compared with other prominent views in the philosophy of mathematics such as neo-Fregeanism, fictionalism, conventionalism, and structuralism. Rules to Infinity serves as an entry point into debates at the forefront of philosophy of science and mathematics, and it defends novel positions in these debates. (shrink)

Category-based induction is an inferential mechanism that uses knowledge of conceptual relations in order to estimate how likely is for a property to be projected from one category to another. During the last decades, psychologists have identified several features of this mechanism, and they have proposed different formal models of it. In this article; we propose a new mathematical model for category-based induction based on distances on conceptual spaces. We show how this model can predict most of (...) the properties of this kind of reasoning while providing a solid theoretical foundation for it. We also show that it subsumes some of the previous models proposed in the literature and that it generates new predictions. (shrink)

It has been common wisdom for centuries that scientific inference cannot be deductive; if it is inference at all, it must be a distinctive kind of inductive inference. According to demonstrative theories of induction, however, important scientific inferences are not inductive in the sense of requiring ampliative inference rules at all. Rather, they are deductive inferences with sufficiently strong premises. General considerations about inferences suffice to show that there is no difference in justification between an inference construed demonstratively or (...) ampliatively. The inductive risk may be shouldered by premises or rules, but it cannot be shirked. Demonstrative theories of induction might, nevertheless, better describe scientific practice. And there may be good methodological reasons for constructing our inferences one way rather than the other. By exploring the limits of these possible advantages, I argue that scientific inference is neither of essence deductive nor of essence inductive. (shrink)

This essay presents a point of view for looking at `free will', with the purpose of interpreting where exactly the freedom lies. For, freedom is what we mean by it. It compares the exercise of free will with the making of inferences, which usually is predominantly inductive in nature. The making of inference and the exercise of free will, both draw upon psychological resources that define our ‘selves’. I examine the constitution of the self of an individual, especially the involvement (...) of personal beliefs, personal memories, affects, emotions, and the hugely important psychological value-system, all of which distinguish the self of one individual from that of another. The foundational position that adopted in this essay is that all psychological processes are correlated with corresponding ones involving large scale neural aggregates in the brain, communicating with one another through wavelike modes of excitation and de-excitation. Of central relevance is the value-network around which the affect system is organized, the latter, in turn, being the axis around which is assembled the self, with all its emotional correlates. The self is a complex system. I include a brief outline of what complexity consists of. In reality all systems are complex, for complexity is ubiquitous, and certain parts of nature appear to us to be ‘simple’ only in certain specific contexts. It is in this background that the issue of determinism is viewed in this essay. Instead of looking at determinism as a grand principle entrenched in nature independent of our interpretation of it, I look at our ability to explain and to predict events and phenomena around us, which is made possible by the existence of causal links running in a complex course that set up correlations between diverse parts of nature, in this way putting the stamp of necessity on these events. However, the complexity of systems limits our ability to explain and to predict to within certain horizons defined by contexts. Our ability to explain and predict in matters relating to acts of free will is similarly limited by the operations of the self that remain hidden from our own awareness. The aspects of necessity and determinism appear to us in the form of reason and rationality that explain and predict only within a limited horizon, while the rest depends on the complex operation of self-linked psychological resources, where the latter appear as contingent in the context of the exercise of free will. The hallmark of complex systems is the existence of amplifying factors that operate as destabilizing ones, along with inhibiting or stabilizing factors as well that generally limit the destabilizing influences to local occurrences, while preserving the global integrity of a system. This complex interplay of destabilizing and stabilizing influences lead to the possibility of an enormous number of distinct modes of behavior that appear as emergent phenomena in complex systems. Looking at the particular case of the self of an individual that guide her actions and thoughts, it is the operation of our emotions, built around the psychological value-system, that provide for the amplifying and inhibiting factors mentioned above. The operation of these self-linked factors stamps our actions and thoughts as contingent ones that do not fit with our concepts of reason and rationality. And this is what provides the basis of our idea of free will. Free will is not ‘free’ in virtue of exemption from causal links running through all our self-based processes - ones that remain hidden from our awareness, but is free of what is perceived to be ‘reason and rationality’ based on knowledge and the common pool of beliefs and principles associated with a shared world-view. When we speak of the choice involved in an act of exercise of free will what we actually refer to is the commonly observed fact that various different individuals of a similar disposition respond differently when placed under similar circumstances. In other words, free will is ‘free’ precisely because it is not subject to constraints of a commonly accepted and shared set of principles, beliefs, and values. While it is possible that, in an exercise of free will, the self-linked psychological resources are brought into action when a number of alternatives are presented to the self by the operation of the ingredients of a commonly shared world-view, it seems likely that, that set of alternatives is not of primary relevance in the final response that the mind produces, since the latter is primarily a product of the operation of the self-based psychological resources. What is of greater relevance here is the operation of emotion-driven processes, guided by the psychological value-system based on the activity of the so-called reward-punishment network in the brain. These processes lead the individual to a response that appears to be free from the shackles of determinism precisely because their mechanisms, which are hidden from us, do not conform to commonly accepted and shared rules and principles. In contrast, inductive inference is a process that is based on the ‘cognitive face’ of self, where the self-based psychological resources play a supportive role to the commonly shared world-view of an individual. There is never any freedom from the all-pervading causal links representing correlations among all objects, entities, and events in nature. In the midst of all this, the closest thing to freedom that we can have in our life comes with self-examination and self-improvement. The possibility of self-examination appears in the form of specific conjunctions between our complex self-processes and the ceaseless changes of scenario in our external world. This actually makes the emergent phenomenon of self-examination a matter of chance, but one that keeps on appearing again and again in our life. Once realized, self examination creates possibilities that would not be there in the absence of it, and these possibilities include the enhancement of further self-enrichment and further diversity in the exercise of our free will. (shrink)

The going-on problem (GOP) is the central concern of Wittgenstein's later philosophy. It informs not only his epistemology and philosophy of mind, but also his views on mathematics, universals, and religion. In section I, I frame this issue as a matter of accounting for intentionality. Here I follow Saul Kripke's lead. My departure therefrom follows: first, a criticism of Wittgenstein's “straight” conventionalism and, secondly, a defense of a solution Kripke rejects. I proceed under the assumption, borne out in the end, (...) that statements of rule-following have truth-conditions and are not, as Kripke seems willing to concede, merely "assertible" in circumstances of a specified sort. Ultimately, my goal is to demonstrate that intending can be understood in terms of an individual's dispositions rather than those of the community to which she belongs. (shrink)

The “Game of the Rule” is easy enough: I give you the beginning of a sequence of numbers (say) and you have to figure out how the sequence continues, to uncover the rule by means of which the sequence is generated. The game depends on two obvious constraints, namely (1) that the initial segment uniquely identify the sequence, and (2) that the sequence be non-random. As it turns out, neither constraint can fully be met, among other reasons because (...) the relevant notion of randomness is either vacuous or undecidable. This may not be a problem when we play for fun. It is, however, a serious problem when it comes to playing the game for real, i.e., when the player to issue the initial segment is not one of us but the world out there, the sequence consisting not of numbers (say) but of the events that make up our history. Moreover, when we play for fun we know exactly what initial segment to focus on, but when we play for real we don’t even know that. This is the core difficulty in the philosophy of the inductive sciences. (shrink)

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as the length of the shortest program producing it [1]. The second, Shannon information, takes events as belonging to ensembles and quantifies the information resulting from observing the given event in terms of the number of alternate events that have been ruled out [2]. The third, statistical learning (...) theory, has introduced measures of capacity that control (in part) the expected risk of classifiers [3]. These capacities quantify the expectations regarding future data that learning algorithms embed into classifiers. Solomonoff and Hutter have applied algorithmic information to prove remarkable results on universal induction. Shannon information provides the mathematical foundation for communication and coding theory. However, both approaches have shortcomings. Algorithmic information is not computable, severely limiting its practical usefulness. Shannon information refers to ensembles rather than actual events: it makes no sense to compute the Shannon information of a single string – or rather, there are many answers to this question depending on how a related ensemble is constructed. Although there are asymptotic results linking algorithmic and Shannon information, it is unsatisfying that there is such a large gap – a difference in kind – between the two measures. This note describes a new method of quantifying information, effective information, that links algorithmic information to Shannon information, and also links both to capacities arising in statistical learning theory [4, 5]. After introducing the measure, we show that it provides a non-universal analog of Kolmogorov complexity. We then apply it to derive basic capacities in statistical learning theory: empirical VC-entropy and empirical Rademacher complexity. A nice byproduct of our approach is an interpretation of the explanatory power of a learning algorithm in terms of the number of hypotheses it falsifies [6], counted in two different ways for the two capacities. We also discuss how effective information relates to information gain, Shannon and mutual information. (shrink)

Indispensablists contend that accepting scientific realism while rejecting mathematical realism involves a double standard. I refute this contention by developing an enhanced version of scientific realism, which I call interactive realism. It holds that interactively successful theories are typically approximately true, and that the interactive unobservable entities posited by them are likely to exist. It is immune to the pessimistic induction while mathematical realism is susceptible to it.

This paper presents a new reconstruction of Wittgenstein’s famous (and controversial) rule-following arguments. Two are the novel features offered by our reconstruction. In the first place, we propose a shift of the central focus of the discussion, from the general semantics and the philosophy of mind to the philosophy of mathematics and the rejection of the notion of a function. The second new feature is positive: we argue that Wittgenstein offers us a new alternative notion of a rule (...) (to replace the rejected functions), a notion reminiscent of Category Theory’s notion of a morphism. (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)

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)

The resolving of the main problem of quantum mechanics about how a quantum leap and a smooth motion can be uniformly described resolves also the problem of how a distribution of reliable data and a sequence of deductive conclusions can be uniformly described by means of a relevant wave function “Ψdata”.

Ayurveda is considered one of the ancient systems of knowledge in India. Various compendiums of Ayurveda i.e., Charaka, Sushruta, or Vagbhatta have enumerated an education system based on Gurukuls i.e., An Educator and their pupils. It is evident from them that a very systematized and organized form of medical education starting from selection to induction and then to effective teaching and training were given during that ancient era. The triad of education viz. Adhyayan (studying), Adhyapan (teaching) and Sambhasha (an (...) argument based on logic) is key to knowledge and the learning process as per Charaka. The selection of students and teachers was based on some set of fixed criteria necessary to be fulfilled. Induction was done prior to admission and proper disciplinary, and ethical rules were practiced. For the development of knowledge and skills in branches of Ayurveda, problems-based case discussion, identification, causes, and treatment of diseases, their principles were taught. Yogya (a set of dummy objects) was used to practice prior to the final surgery. (shrink)

Consider the following. The first is a one-premise argument; the second has two premises. The question sign marks the conclusions as such. -/- Matthew, Mark, Luke, and John wrote Greek. ? Every evangelist wrote Greek. -/- Matthew, Mark, Luke, and John wrote Greek. Every evangelist is Matthew, Mark, Luke, or John. ? Every evangelist wrote Greek. -/- The above pair of premise-conclusion arguments is of a sort familiar to logicians and philosophers of science. In each case the first premise is (...) logically equivalent to the set of four atomic propositions: “Matthew wrote Greek”, “Mark wrote Greek”, “Luke wrote Greek”, and “John wrote Greek”. The universe of discourse is the set of evangelists. We presuppose standard first-order logic. -/- As many logic texts teach, the first of these two premise-conclusion arguments—sometimes called a complete enumerative induction— is invalid in the sense that its conclusion does not follow from its premises. To get a counterargument, replace ‘Matthew’, ‘Mark’, ‘Luke’, and ‘John’ by ‘two’,’four’, ‘six’ and ‘eight’; replace ‘wrote Greek’ by ‘are even’; and replace ‘evangelist’ by ‘number’. This replacement converts the first argument into one having true premises and false conclusion. -/- But the same replacement performed on the second argument does no such thing: it converts the second premise into the falsehood “Every number is two, four, six, or eight”. As many logic texts teach, there is no replacement that converts the second argument into one with all true premises and false conclusion. The second is valid; its conclusion is deducible from its two premises using an instructive natural deduction. -/- This paper “does the math” behind the above examples. The theorem could be stated informally: the above examples are typical. (shrink)

Ideas on meaning, rules and mathematical proofs abound in Wittgenstein’s writings. The undeniable fact that they are present together, sometimes intertwined in the same passage of Philosophical Investigations or Remarks on the Foundations of Mathematics, does not show, however, that the connection between these ideas is necessary or inextricable. The possibility remains, and ought to be checked, that they can be plausibly and consistently separated. I am going to examine two views detectable in Wittgenstein’s works: one about proofs, the (...) other about meaning and rules. The first is the denial of the objectivity of proof. The second is a conception of meaning stemming from the rule-following considerations. I shall argue that, though Wittgenstein seems to conjoin the two views, they can be, and should be, separated1. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set (...) theory. Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition (...) for granting the Gödel incompleteness statement to be a theorem just as the statement itself, to be an axiom. Then, the “completeness paper” can be interpreted as relevant to Hilbert mathematics, according to which mathematics and reality as well as arithmetic and set theory are rather entangled or complementary rather than mathematics to obey reality able only to create models of the latter. According to that, both papers (1930; 1931) can be seen as advocating Russell’s logicism or the intensional propositional logic versus both extensional arithmetic and set theory. Reconstructing history of philosophy, Aristotle’s logic and doctrine can be opposed to those of Plato or the pre-Socratic schools as establishing ontology or intensionality versus extensionality. Husserl’s phenomenology can be analogically realized including and particularly as philosophy of mathematics. One can identify propositional logic and set theory by virtue of Gödel’s completeness theorem (1930: “Satz VII”) and even both and arithmetic in the sense of the “compactness theorem” (1930: “Satz X”) therefore opposing the latter to the “incompleteness paper” (1931). An approach identifying homomorphically propositional logic and set theory as the same structure of Boolean algebra, and arithmetic as the “half” of it in a rigorous construction involving information and its unit of a bit. Propositional logic and set theory are correspondingly identified as the shared zero-order logic of the class of all first-order logics and the class at issue correspondingly. Then, quantum mechanics does not need any quantum logics, but only the relation of propositional logic, set theory, arithmetic, and information: rather a change of the attitude into more mathematical, philosophical, and speculative than physical, empirical and experimental. Hilbert’s epsilon calculus can be situated in the same framework of the relation of propositional logic and the class of all mathematical theories. The horizon of Part III investigating Hilbert mathematics (i.e. according to the Pythagorean viewpoint about the world as mathematical) versus Gödel mathematics (i.e. the usual understanding of mathematics as all mathematical models of the world external to it) is outlined. (shrink)

Mathematics appears to play an explanatory role in science. This, in turn, is thought to pave a way toward mathematical Platonism. A central challenge for mathematical Platonists, however, is to provide an account of how mathematical explanations work. I propose a property-based account: physical systems possess mathematical properties, which either guarantee the presence of other mathematical properties and, by extension, the physical states that possess them; or rule out other mathematical properties, and their (...) associated physical states. I explain why Platonists should accept that physical systems have mathematical properties, and why a property based account is better than existing accounts of mathematical explanation. I close by considering whether nominalists can accept the view I propose here. I argue that they cannot. (shrink)

The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional logic. Sentence schemata have been used in axiomatizations of logic only since the landmark 1927 von Neumann paper [31]. Modern philosophers know the role of schemata in explications of the semantic conception of truth through Tarski’s 1933 Convention T [42]. Mathematical logicians recognize the role of schemata in first-order number theory where Peano’s second-order Induction Axiom is approximated by (...) Herbrand’s Induction-Axiom Schema [23]. Similarly, in first-order set theory, Zermelo’s second-order Separation Axiom is approximated by Fraenkel’s first-order Separation Schema [17]. In some of several closely related senses, a schema is a complex system having multiple components one of which is a template-text or scheme-template, a syntactic string composed of one or more “blanks” and also possibly significant words and/or symbols. In accordance with a side condition the template-text of a schema is used as a “template” to specify a multitude, often infinite, of linguistic expressions such as phrases, sentences, or argument-texts, called instances of the schema. The side condition is a second component. The collection of instances may but need not be regarded as a third component. The instances are almost always considered to come from a previously identified language (whether formal or natural), which is often considered to be another component. This article reviews the often-conflicting uses of the expressions ‘schema’ and ‘scheme’ in the literature of logic. It discusses the different definitions presupposed by those uses. And it examines the ontological and epistemic presuppositions circumvented or mooted by the use of schemata, as well as the ontological and epistemic presuppositions engendered by their use. In short, this paper is an introduction to the history and philosophy of schemata. (shrink)

Investigation into the sequence structure of the genetic code by means of an informatic approach is a real success story. The features of human language are also the object of investigation within the realm of formal language theories. They focus on the common rules of a universal grammar that lies behind all languages and determine generation of syntactic structures. This universal grammar is a depiction of material reality, i.e., the hidden logical order of things and its relations determined by natural (...) laws. Therefore mathematics is viewed not only as an appropriate tool to investigate human language and genetic code structures through computer sciencebased formal language theory but is itself a depiction of material reality. This confusion between language as a scientific tool to describe observations/experiences within cognitive constructed models and formal language as a direct depiction of material reality occurs not only in current approaches but was the central focus of the philosophy of science debate in the twentieth century, with rather unexpected results. This article recalls these results and their implications for more recent mathematical approaches that also attempt to explain the evolution of human language. (shrink)

This paper discusses Frege's account of definition by induction in Grundgesetze and the two key theorems Frege proves using it.

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.

This article explores some open questions related to the problem of verification of theories in the context of empirical sciences by contrasting three epistemological frameworks. Each of these epistemological frameworks is based on a corresponding central metaphor, namely: (a) Neo-empiricism and the gambling metaphor; (b) Popperian falsificationism and the scientific tribunal metaphor; (c) Cognitive constructivism and the object as eigen-solution metaphor. Each of one of these epistemological frameworks has also historically co-evolved with a certain statistical theory and method for testing (...) scientific hypotheses, respectively: (a) Decision theoretic Bayesian statistics and Bayes factors; (b) Frequentist statistics and p-values; (c) Constructive Bayesian statistics and e-values. This article examines with special care the Zero Probability Paradox (ZPP), related to the verification of sharp or precise hypotheses. Finally, this article makes some remarks on Lakatos’ view of mathematics as a quasi-empirical science. (shrink)

This self-contained one page paper produces one valid two-premise premise-conclusion argument that is a counterexample to the entire three traditional rules of distribution. These three rules were previously thought to be generally applicable criteria for invalidity of premise-conclusion arguments. No longer can a three-term argument be dismissed as invalid simply on the ground that its middle is undistributed, for example. The following question seems never to have been raised: how does having an undistributed middle show that an argument's conclusion does (...) not follow from its premises? This result does nothing to vitiate the theories of distribution developed over the period beginning in medieval times. What it does vitiate is many if not all attempts to use distribution in tests of invalidity outside of the standard two-premise categorical arguments—where they were verified on a case-by-case basis without further theoretical grounding. In addition it shows that there was no theoretical basis for many if not all claims of fundamental status of rules of distribution. These results are further support for approaching historical texts using mathematical archeology. (shrink)

This paper presents a Peircean take on Wittgenstein's famous rule-following problem as it pertains to 'knowing how to go on in mathematics'. I argue that McDowell's advice that the philosophical picture of 'rules as rails' must be abandoned is not sufficient on its own to fully appreciate mathematics' unique blend of creativity and rigor. Rather, we need to understand how Peirce counterposes to the brute compulsion of 'Secondness', both the spontaneity of 'Firstness' and also the rational intelligibility of 'Thirdness'. (...) This is a written version of a presentation I gave at the “Peirce’s Mathematics” conference, Universidad Nacional de Colombia, November 25-27, 2015, which was organized by Professor Fernando Zalamea. The piece owes much to the inspiration of Prof. Zalamea's writings on philosophy of mathematics. (shrink)

The first learning game to be developed to help students to develop and hone skills in constructing proofs in both the propositional and first-order predicate calculi. It comprises an autotelic (self-motivating) learning approach to assist students in developing skills and strategies of proof in the propositional and predicate calculus. The text of VALIDITY consists of a general introduction that describes earlier studies made of autotelic learning games, paying particular attention to work done at the Law School of Yale University, called (...) the ALL Project (Accelerated Learning of Logic). Following the introduction, the game of VALIDITY is described, first with reference to the propositional calculus, and then in connection with the first-order predicate calculus with identity. Sections in the text are devoted to discussions of the various rules of derivation employed in both calculi. Three appendices follow the main text; these provide a catalogue of sequents and theorems that have been proved for the propositional calculus and for the predicate calculus, and include suggestions for the classroom use of VALIDITY in university-level courses in mathematical logic. (shrink)

In this article I present a disagreement between classical and constructive approaches to predicativity regarding the predicative status of so-called generalised inductive definitions. I begin by offering some motivation for an enquiry in the predicative foundations of constructive mathematics, by looking at contemporary work at the intersection between mathematics and computer science. I then review the background notions and spell out the above-mentioned disagreement between classical and constructive approaches to predicativity. Finally, I look at possible ways of defending the constructive (...) predicativity of inductive definitions. (shrink)

At its strongest, Hume's problem of induction denies the existence of any well justified assumptionless inductive inference rule. At the weakest, it challenges our ability to articulate and apply good inductive inference rules. This paper examines an analysis that is closer to the latter camp. It reviews one answer to this problem drawn from the VC theorem in statistical learning theory and argues for its inadequacy. In particular, I show that it cannot be computed, in general, whether we (...) are in a situation where the VC theorem can be applied for the purpose we want it to. (shrink)

This note corrects an error in my paper 'Normalisation and Subformula Property for a System of Classical Logic with Tarski's Rule' (Archive for Mathematical Logic 61 (2022): 105-129, DOI 10.1007/s00153-021-00775-6): Theorem 2 is mistaken, and so is a corollary drawn from it as well as a corollary that was concluded by the same mistake. Luckily this does not affect the main result of the paper.

The first decade of this century has seen the nascency of the first mathematical theory of general artificial intelligence. This theory of Universal Artificial Intelligence (UAI) has made significant contributions to many theoretical, philosophical, and practical AI questions. In a series of papers culminating in book (Hutter, 2005), an exciting sound and complete mathematical model for a super intelligent agent (AIXI) has been developed and rigorously analyzed. While nowadays most AI researchers avoid discussing intelligence, the award-winning PhD thesis (...) (Legg, 2008) provided the philosophical embedding and investigated the UAI-based universal measure of rational intelligence, which is formal, objective and non-anthropocentric. Recently, effective approximations of AIXI have been derived and experimentally investigated in JAIR paper (Veness et al. 2011). This practical breakthrough has resulted in some impressive applications, finally muting earlier critique that UAI is only a theory. For the first time, without providing any domain knowledge, the same agent is able to self-adapt to a diverse range of interactive environments. For instance, AIXI is able to learn from scratch to play TicTacToe, Pacman, Kuhn Poker, and other games by trial and error, without even providing the rules of the games. These achievements give new hope that the grand goal of Artificial General Intelligence is not elusive. This article provides an informal overview of UAI in context. It attempts to gently introduce a very theoretical, formal, and mathematical subject, and discusses philosophical and technical ingredients, traits of intelligence, some social questions, and the past and future of UAI. (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 this paper, I discuss how Newton’s inductive argument of the Principia can be defended against criticisms levelled against it by Duhem, Popper and myself. I argue that Duhem’s and Popper’s criticisms can be countered, but mine cannot. It requires that we reconsider, not just Newton’s inductive argument in the Principia, but also the nature of science more generally. The methods of science, whether conceived along inductivist or hypothetico-deductivist lines, make implicit metaphysical presuppositions which rigour requires we make explicit within (...) science so that they can be critically assessed, alternatives being developed and assessed, in the hope that they can be improved. Despite claiming to derive his law of gravitation by induction from phenomena without resource to hypotheses, Newton does nevertheless acknowledge in the Principia that his rules of reasoning make metaphysical presuppositions. To this extent, Newton has a more enlightened view of scientific method than most 20th and 21st century scientists and historians and philosophers of science. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...) I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (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)