Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

The aim of this paper is to establish a phenomenological mathematical intuitionism that is based on fundamental phenomenological-epistemological principles. According to this intuitionism, mathematical intuitions are sui generis mental states, namely experiences that exhibit a distinctive phenomenal character. The focus is on two questions: what does it mean to undergo a mathematical intuition and what role do mathematical intuitions play in mathematical reasoning? While I crucially draw on Husserlian principles and adopt ideas we find in phenomenologically minded mathematicians such as (...) Hermann Weyl and Kurt Gödel, the overall objective is systematic in nature: to offer a plausible approach towards mathematics. (shrink)

Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent (in an informal sense) and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar (...) at Princeton in 1934. Seen in the historical context, Gödel was an important catalyst for the emergence of computability theory in the mid 1930s. (shrink)

This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.

This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. I provide a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (shrink)

Frege's philosophical writings, including the “logistic project,” acquire a new insight by being confronted with Kant's criticism and Wittgenstein's logical and grammatical investigations. Between these two points a non-formalist history of logic is just taking shape, a history emphasizing the Greek and Kantian inheritance and its aftermath. It allows us to understand the radical change in rationality introduced by Gottlob Frege's syntax. This syntax put an end to Greek categorization and opened the way to the multiplicity of expressions producing their (...) own intelligibility. This article is based on more technical analyses of Frege which Claude Imbert has previously offered in other writings. (shrink)

Prior Analytics by the Greek philosopher Aristotle and Laws of Thought by the English mathematician George Boole are the two most important surviving original logical works from before the advent of modern logic. This article has a single goal: to compare Aristotle's system with the system that Boole constructed over twenty-two centuries later intending to extend and perfect what Aristotle had started. This comparison merits an article itself. Accordingly, this article does not discuss many other historically and philosophically important aspects (...) of Boole's book, e.g. his confused attempt to apply differential calculus to logic, his misguided effort to make his system of ‘class logic’ serve as a kind of ‘truth-functional logic’, his now almost forgotten foray into probability theory, or his blindness to the fact that a truth-functional combination of equations that follows from a given truth-functional combination of equations need not follow truth-functionally. One of the main conclusions is that Boole's contribution widened logic and changed its nature to such an extent that he fully deserves to share with Aristotle the status of being a founding figure in logic. By setting forth in clear and systematic fashion the basic methods for establishing validity and for establishing invalidity, Aristotle became the founder of logic as formal epistemology. By making the first unmistakable steps toward opening logic to the study of ‘laws of thought’—tautologies and laws such as excluded middle and non-contradiction—Boole became the founder of logic as formal ontology.… using mathematical methods … has led to more knowledge about logic in one century than had been obtained from the death of Aristotle up to … when Boole's masterpiece was published.Paul Rosenbloom 1950. (shrink)

The birth, growth, stabilization and subsequent understanding of a new field of practical and theoretical enquiry is always a conceptual process including several typologies of events, phenomena an...

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

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

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)

At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other set-theoretic (...) systems ZF, NBG, and NF. We discuss two methods of axiomatizing higher order quantification and abstraction, and then very briefly discuss the application of one of these methods to areas of mathematics outside of logic. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

This paper offers a new interpretation for Wittgenstein`s treatment of mathematical identities. As it is widely known, Wittgenstein`s mature philosophy of mathematics includes a general rejection of abstract objects. On the other hand, the traditional interpretation of mathematical identities involves precisely the idea of a single abstract object – usually a number –named by both sides of an equation.

Monomodal logic has exactly two maximally normal logics, which are also the only quasi-normal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maximally normal logics that are not valid in any Kripke frame, or even in any complete modal algebra. We also construct continuum many quasi-normal Post complete logics that are not normal. The set of extensions (...) of S4.3 is radically altered by the addition of a constant: we use it to construct continuum many such normal extensions of S4.3, and continuum many non-normal ones, none of which have the finite model property. But for logics with weakly transitive frames there are only eight maximally normal ones, of which five extend K4 and three extend S4. (shrink)

We seek means of distinguishing logical knowledge from other kinds of knowledge, especially mathematics. The attempt is restricted to classical two-valued logic and assumes that the basic notion in logic is the proposition. First, we explain the distinction between the parts and the moments of a whole, and theories of ?sortal terms?, two theories that will feature prominently. Second, we propose that logic comprises four ?momental sectors?: the propositional and the functional calculi, the calculus of asserted propositions, and rules for (...) (in)valid deduction, inference or substitution. Third, we elaborate on two neglected features of logic: the various modes of negating some part(s) of a proposition R, not only its ?external? negation not-R; and the assertion of R in the pair of propositions ?it is (un)true that R? belonging to the neglected logic of asserted propositions, which is usually left unstated. We also address the overlooked task of testing the asserted truth-value of R. Fourth, we locate logic among other foundational studies: set theory and other theories of collections, metamathematics, axiomatisation, definitions, model theory, and abstract and operator algebras. Fifth, we test this characterisation in two important contexts: the formulation of some logical paradoxes, especially the propositional ones; and indirect proof-methods, especially that by contradiction. The outcomes differ for asserted propositions from those for unasserted ones. Finally, we reflect upon self-referring self-reference, and on the relationships between logical and mathematical knowledge. A subject index is appended. (shrink)

A collection of material on Husserl's Logical Investigations, and specifically on Husserl's formal theory of parts, wholes and dependence and its influence in ontology, logic and psychology. Includes translations of classic works by Adolf Reinach and Eugenie Ginsberg, as well as original contributions by Wolfgang Künne, Kevin Mulligan, Gilbert Null, Barry Smith, Peter M. Simons, Roger A. Simons and Dallas Willard. Documents work on Husserl's ontology arising out of early meetings of the Seminar for Austro-German Philosophy.

Inferentialism is the conviction that to be meaningful in the distinctively human way, or to have a 'conceptual content', is to be governed by a certain kind of inferential rules. The term was coined by Robert Brandom as a label for his theory of language; however, it is also naturally applicable (and is growing increasingly common) within the philosophy of logic.

This paper discusses the history of the confusion and controversies over whether the definition of consequence presented in the 11-page 1936 Tarski consequence-definition paper is based on a monistic fixed-universe framework?like Begriffsschrift and Principia Mathematica. Monistic fixed-universe frameworks, common in pre-WWII logic, keep the range of the individual variables fixed as the class of all individuals. The contrary alternative is that the definition is predicated on a pluralistic multiple-universe framework?like the 1931 Gödel incompleteness paper. A pluralistic multiple-universe framework recognizes multiple (...) universes of discourse serving as different ranges of the individual variables in different interpretations?as in post-WWII model theory. In the early 1960s, many logicians?mistakenly, as we show?held the ?contrary alternative? that Tarski 1936 had already adopted a Gödel-type, pluralistic, multiple-universe framework. We explain that Tarski had not yet shifted out of the monistic, Frege?Russell, fixed-universe paradigm. We further argue that between his Principia-influenced pre-WWII Warsaw period and his model-theoretic post-WWII Berkeley period, Tarski's philosophy underwent many other radical changes. (shrink)

This paper examines the contemporary philosophical and cognitive relevance of Charles Peirce's diagrammatic logic of existential graphs (EGs), the ‘moving pictures of thought’. The first part brings to the fore some hitherto unknown details about the reception of EGs in the early 1900s that took place amidst the emergence of modern conceptions of symbolic logic. In the second part, philosophical aspects of EGs and their contributions to contemporary logical theory are pointed out, including the relationship between iconic logic and images, (...) the problem of the meaning of logical constants, the cognitive economy of iconic logic, the failure of the Frege–Russell thesis, and the failure of the Language of Thought hypothesis. (shrink)

Set theory deals with the most fundamental existence questions in mathematics—questions which affect other areas of mathematics, from the real numbers to structures of all kinds, but which are posed as dealing with the existence of sets. Especially noteworthy are principles establishing the existence of some infinite sets, the so-called “arbitrary sets.” This paper is devoted to an analysis of the motivating goal of studying arbitrary sets, usually referred to under the labels of quasi-combinatorialism or combinatorial maximality. After explaining what (...) is meant by definability and by “arbitrariness,” a first historical part discusses the strong motives why set theory was conceived as a theory of arbitrary sets, emphasizing connections with analysis and particularly with the continuum of real numbers. Judged from this perspective, the axiom of choice stands out as a most central and natural set-theoretic principle (in the sense of quasi-combinatorialism). A second part starts by considering the potential mismatch between the formal systems of mathematics and their motivating conceptions, and proceeds to offer an elementary discussion of how far the Zermelo—Fraenkel system goes in laying out principles that capture the idea of “arbitrary sets”. We argue that the theory is rather poor in this respect. (shrink)

In 1905, Richard discovered his paradox of definability, and in a letter written that year he presented both the paradox and a solution to it.Soon afterwards, Poincaré endorsed a variant of Richard?s solution.In this paper, I critically examine Richard?s and Poincaré?s ways out.I draw on an objection of Peano?s, and argue that their stated solutions do not work.But I also claim that their writings suggest another way out, different from their stated solutions, and different from the orthodox Tarskian approach.I argue (...) that this second solution does not prevent the return of the paradox. (shrink)

This paper discusses George Boole’s two distinct approaches to the explanatory relationship between logical and psychological theory. It is argued that, whereas in his first book he attributes a substantive role to psychology in the foundation of logical theory, in his second work he abandons that position in favour of a linguistically conceived foundation. The early Boole espoused a type of psychologism and later came to adopt a type of anti-psychologism. To appreciate this invites a far-reaching reassessment of his philosophy (...) of logic. (shrink)

This paper focuses on two notions of effectiveness which are not treated in detail elsewhere. Unlike the standard computability notion, which is a property of functions themselves, both notions of effectiveness are properties of interpreted linguistic presentations of functions. It is shown that effectiveness is epistemically at least as basic as computability in the sense that decisions about computability normally involve judgments concerning effectiveness. There are many occurrences of the present notions in the writings of logicians; moreover, consideration of these (...) notions can contribute to the clarification and, perhaps, solution of various philosophical problems, confusions and disputes. (shrink)

Charles L. Dodgson's reputation as a significant figure in nineteenth-century logic was firmly established when the philosopher and historian of philosophy William Warren Bartley, III published Dodgson's ?lost? book of logic, Part II of Symbolic Logic, in 1977. Bartley's commentary and annotations confirm that Dodgson was a superb technical innovator. In this paper, I closely examine Dodgson's methods and their evolution in the two parts of Symbolic Logic to clarify and justify Bartley's claims. Then, using more recent publications and unpublished (...) letters, I argue that Dodgson approached the elimination problem in class logic differently than his contemporaries, and in doing so, anticipated several important concepts and techniques in automated deductive reasoning. These materials also provide additional insight into his reasons for writing this book. (shrink)

The paper begins with an examination of Gödel's views on absolute undecidability and related topics in set theory. These views are sharpened and assessed in light of recent developments. It is argued that a convincing case can be made for axioms that settle many of the questions undecided by the standard axioms and that in a precise sense the program for large cardinals is a complete success “below” CH. It is also argued that there are reasonable scenarios for settling CH (...) and that there is not currently a convincing case to the effect that a given statement is absolutely undecidable. (shrink)

Aristotle’s words in the Metaphysics: “to say of what is that it is, or of what is not that it is not, is true” are often understood as indicating a correspondence view of truth: a statement is true if it corresponds to something in the world that makes it true. Aristotle’s words can also be interpreted in a deflationary, i.e., metaphysically less loaded, way. According to the latter view, the concept of truth is contained in platitudes like: ‘It is true (...) that snow is white iff snow is white’, ‘It is true that neutrinos have mass iff neutrinos have mass’, etc. Our understanding of the concept of truth is exhausted by these and similar equivalences. This is all there is to truth. In his book Truth (Second edition 1998), Paul Horwich develops minimalism, a special variant of the deflationary view. According to Horwich’s minimalism, truth is an indefinable property of propositions characterized by what he calls the minimal theory, i.e., all (nonparadoxical) propositions of the form: It is true that p if and only if p. Although the idea of minimalism is simple and straightforward, the proper formulation of Horwich’s theory is no simple matter. In this paper, I shall discuss some of the difficulties of a logical nature that arise. First, I discuss problems that arise when we try to give a rigorous characterization of the theory without presupposing a prior understanding of the notion of truth. Next I turn to Horwich’s treatment of the Liar paradox and a paradox about the totality of all propositions that was first formulated by Russell (1903). My conclusion is that Horwich’s minimal theory cannot deal with these difficulties in an adequate way, and that it has to be revised in fundamental ways in order to do so. Once such revisions have been carried out the theory may, however, have lost some of its appealing simplicity. (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)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Nykyaikaisen logiikan keskeisenä tutkimuskohteena ovat erilaiset formalisoidut teoriat. Erityisesti vuosisadan vaihteen aikoihin matematiikan perusteiden tutkimuksessa ilmaantuneiden hämmentävien paradoksien (Russell 1902, 1903) jälkeen (ks. kuitenkin jo Frege 1879, Dedekind 1888, Peano 1889; vrt. Wang 1957) keskeiset matemaattiset teoriat on pyritty tällaisten vaikeuksien välttämiseksi uudelleen muotoilemaan täsmällisesti keinotekoisessa symbolikielessä, jonka lauseenmuodostussäännöt on täsmällisesti ja yksikäsitteisesti määrätty. Edelleen teoriat on pyritty aksiomatisoimaan, ts. on pyritty antamaan joukko peruslauseita, joista kaikki muut - tai ainakin mahdollisimman monet - teorian todet lauseet voidaan loogisesti johtaa tarkoin (...) määrättyjen päättelysääntöjen mukaisesti (erityisesti Hilbert 1904, 1918, 1927; ks. myös Russell 1908, Zermelo 1908; vrt. Kleene 1952, §§ 14−15). (shrink)

Prior Analytics by the Greek philosopher Aristotle (384 – 322 BCE) and Laws of Thought by the English mathematician George Boole (1815 – 1864) are the two most important surviving original logical works from before the advent of modern logic. This article has a single goal: to compare Aristotle’s system with the system that Boole constructed over twenty-two centuries later intending to extend and perfect what Aristotle had started. This comparison merits an article itself. Accordingly, this article does not discuss (...) many other historically and philosophically important aspects of Boole’s book, e.g. his confused attempt to apply differential calculus to logic, his misguided effort to make his system of ‘class logic’ serve as a kind of ‘truth-functional logic’, his now almost forgotten foray into probability theory, or his blindness to the fact that a truth-functional combination of equations that follows from a given truth-functional combination of equations need not follow truth-functionally. One of the main conclusions is that Boole’s contribution widened logic and changed its nature to such an extent that he fully deserves to share with Aristotle the status of being a founding figure in logic. By setting forth in clear and systematic fashion the basic methods for establishing validity and for establishing invalidity, Aristotle became the founder of logic as formal epistemology. By making the first unmistakable steps toward opening logic to the study of ‘laws of thought’—tautologies and laws such as excluded middle and non-contradiction—Boole became the founder of logic as formal ontology. (shrink)

After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses atthe (...) University of Göttingen between 1917 and 1923, and notably in Ackermann's dissertation of 1924. The main innovation was theinvention of the -calculus, on which Hilbert's axiom systemswere based, and the development of the -substitution methodas a basis for consistency proofs. The paper traces the developmentof the ``simultaneous development of logic and mathematics'' throughthe -notation and provides an analysis of Ackermann'sconsistency proofs for primitive recursive arithmetic and for thefirst comprehensive mathematical system, the latter using thesubstitution method. It is striking that these proofs use transfiniteinduction not dissimilar to that used in Gentzen's later consistencyproof as well as non-primitive recursive definitions, and that thesemethods were accepted as finitistic at the time. (shrink)

Few have entertained the idea that Georg Cantor, the creator of set theory, might have influenced Edmund Husserl, the founder of the phenomenological movement. Yet an exchange of ideas took place between them when Cantor was at the height of his creative powers and Husserl in the throes of an intellectual struggle during which his ideas were particularly malleable and changed considerably and definitively. Here their writings are examined to show how Husserl's and Cantor's ideas overlapped and crisscrossed in the (...) areas of philosophy and mathematics, arithmetization, abstraction, consciousness and pure logic, psychologism, metaphysical idealism, new numbers, and sets and manifolds. (shrink)

We examine George Boolos's proposed abstraction principle for extensions based on the limitation-of-size conception, New V, from several perspectives. Crispin Wright once suggested that New V could serve as part of a neo-logicist development of real analysis. We show that it fails both of the conservativeness criteria for abstraction principles that Wright proposes. Thus, we support Boolos against Wright. We also show that, when combined with the axioms for Boolos's iterative notion of set, New V yields a system equivalent to (...) full Zermelo-Fraenkel set theory with a principle of global choice. This advances Boolos's longstanding interest in the foundations of set theory. (shrink)

George Boolos has argued that the iterative conception of set justifies most, but not all, the ZFC axioms, and that a second conception of set, the Frege-von Neumann conception (FN), justifies the remaining axioms. This article challenges Boolos's claim that FN does better than the iterative conception at justifying the axioms in question.

This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...) Turing, was not a computable sequence (i.e., one that could be generated by a Turing machine). Since computers only contained a finite number of instructions (or programs), one might argue, they could not reproduce human intelligence. Turing called this the “mathematical
objection” to his view that machines can think. Logico-mathematical reasons, stemming from his own work, helped to convince Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. He felt it
should be possible to program a computer so that it could learn or discover new rules, overcoming the limitations imposed by the incompleteness and undecidability results in the same way that human
mathematicians presumably do. (shrink)

L’Ipotesi del Continuo, formulata da Cantor nel 1878, è una delle congetture più note della teoria degli insiemi. Il Problema del Continuo, che ad essa è collegato, fu collocato da Hilbert, nel 1900, fra i principali problemi insoluti della matematica. A seguito della dimostrazione di indipendenza dell’Ipotesi del Continuo dagli assiomi della teoria degli insiemi, lo status attuale del problema è controverso. In anni più recenti, la ricerca di una soluzione del Problema del Continuo è stata anche una delle ragioni (...) fondamentali per la ricerca di nuovi assiomi in matematica. L’articolo fornisce un quadro generale dei risultati matematici fondamentali, e un’analisi di alcune delle questioni filosofiche connesse al Problema del Continuo. (shrink)