The present PhD dissertation aims to examine the relation between modality and change in Aristotle’s metaphysics. -/- On the one hand, Aristotle supports his modal realism (i.e., worldly objects have modal properties - potentialities and essences - that ground the ascriptions of possibility and necessity) by arguing that the rejection of modal realism makes change inexplicable, or, worse, banishes it from the realm of reality. On the other hand, the Stagirite analyses processes by means of modal notions (‘change is the (...) actuality of what is virtual insofar as it is virtual’). In other words: to grasp what change is, one has to resort to the modal idiom of potentialities, while the fact that there is change is indicative of the fact that nature is full of modal properties. -/- Aristotle’s modal and kinetic realism finds a negative in the figure of the Megaric Diodorus Kronus. The polemical situation of Greek philosophy has indeed the dialectical advantage of not opposing the Aristotelian position to a sui generis straw man. Both in its reduction of modal judgements to temporal quantifications and in its dissolution of the reality of the state-of-being-in-motion in favour of a cinematographic view of processes, the philosophical figure of reductionist antirealism embodied by Diodorus constitutes an alternative that takes the opposite view of Aristotle’s realism. -/- The present study is structured as a discussion between these two positions. In the face of Diodorus’ antirealist challenges, Aristotle articulates modal and kinetic considerations: the answers he gives to Diodorus’ puzzles thus provide valuable insight into his metaphysics. Moreover, the examination of Aristotle’s and Diodorus’ metaphysics, because of their insight and originality, will not fail to interest the philosopher concerned with the metaphysical foundations of modern physics, insofar as the entanglement between modalities and processes is nowadays at the core of mechanics (phase spaces, path integrals, etc.). (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

The primary aim is the reconstruction of the main argument of the second chapter of Anselm’s Proslogion. To be proved is the statement that God, or something than which nothing greater can be thought, exists in reality. I proceed by a piecemeal analysis of every sentence of the Latin original and its subsequent translation into a formal second-order language with choice operator. Reconstructing Anselm’s reasoning demands interpretative input and additions. For example, the formula ‘quod maius est’ has to be suitably (...) interpreted and expanded. Furthermore, I try to explicate Anselm’s maius predicate in terms of a perfection predicate and to develop a general proof for Anselm’s theorem, i.e. the statement that something/that than which something greater cannot be thought has all greater-making attributes. (shrink)

I argue that absolutism, the view that absolutely unrestricted quantification is possible, is to blame for both the paradoxes that arise in naive set theory and variants of these paradoxes that arise in plural logic and in semantics. The solution is restrictivism, the view that absolutely unrestricted quantification is not possible. -/- It is generally thought that absolutism is true and that restrictivism is not only false, but inexpressible. As a result, the paradoxes are blamed, not on illicit quantification, but (...) on the logical conception of set which motivates naive set theory. The accepted solution is to replace this with the iterative conception of set. -/- I show that this picture is doubly mistaken. After a close examination of the paradoxes in chapters 2--3, I argue in chapters 4 and 5 that it is possible to rescue naive set theory by restricting quantification over sets and that the resulting restrictivist set theory is expressible. In chapters 6 and 7, I argue that it is the iterative conception of set and the thesis of absolutism that should be rejected. (shrink)

We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction and truth (...) to the compound formulas of PA over N---I_PA(N; SV ) and I_PA(N; SC). We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both I_PA(N; SV ) and I_PA(N; SC). We then show: (a) that if we assume the satisfaction and truth of the compound formulas of PA are always non-finitarily decidable under I_PA(N; SV ), then this assignment corresponds to the classical non-finitary putative standard interpretation I_PA(N; S) of PA over the domain N; and (b) that the satisfaction and truth of the compound formulas of PA are always finitarily decidable under the assignment I_PA(N; SC), from which we may finitarily conclude that PA is consistent. We further conclude that the appropriate inference to be drawn from Goedel's 1931 paper on undecidable arithmetical propositions is that we can define PA formulas which---under interpretation---are algorithmically verifiable as always true over N, but not algorithmically computable as always true over N. We conclude from this that Lucas' Goedelian argument is validated if the assignment I_PA(N; SV ) can be treated as circumscribing the ambit of human reasoning about `true' arithmetical propositions, and the assignment I_PA(N; SC) as circumscribing the ambit of mechanistic reasoning about `true' arithmetical propositions. (shrink)

In this paper we study several translations that map models and formulae of the language of second-order arithmetic to models and formulae of the language of truth. These translations are useful because they allow us to exploit results from the extensive literature on arithmetic to study the notion of truth. Our purpose is to present these connections in a systematic way, generalize some well-known results in this area, and to provide a number of new results. Sections 3 and 4 contain (...) some recursion- and proof-theoretic results about Kripke-style fixed-point theories of truth. Section 5 shows how to derive full second-order arithmetic from principles of truth. Section 6 investigates the proof-theoretic strength of disquotation without an arithmetical base theory. (shrink)

Logics for generally were introduced for handling assertions with vague notions,such as generally, most, several, etc., by generalized quantifiers, ultrafilter logic being an interesting case. Here, we show that ultrafilter logic can be faithfully embedded into a first-order theory of certain functions, called coherent. We also use generic functions (akin to Skolem functions) to enable elimination of the generalized quantifier. These devices permit using methods for classical first-order logic to reason about consequence in ultrafilter logic.

In a recent paper Johan van Benthem reviews earlier work done by himself and colleagues on ‘natural logic’. His paper makes a number of challenging comments on the relationships between traditional logic, modern logic and natural logic. I respond to his challenge, by drawing what I think are the most significant lines dividing traditional logic from modern. The leading difference is in the way logic is expected to be used for checking arguments. For traditionals the checking is local, i.e. separately (...) for each inference step. Between inference steps, several kinds of paraphrasing are allowed. Today we formalise globally: we choose a symbolisation that works for the entire argument, and thus we eliminate intuitive steps and changes of viewpoint during the argument. Frege and Peano recast the logical rules so as to make this possible. I comment also on the traditional assumption that logical processing takes place at the top syntactic level, and I question Johan’s view that natural logic is ‘natural’. (shrink)

Wittgensteinian predicate logic (W-logic) is characterized by the requirement that the objects mentioned within the scope of a quantifier be excluded from the range of the associated bound variable. I present a sound and complete tableaux calculus for this logic and discuss issues of translatability between Wittgensteinian and standard predicate logic in languages with and without individual constants. A metalinguistic co-denotation predicate, akin to Frege’s triple bar of the Begriffsschrift, is introduced and used to bestow the full expressive power of (...) first-order logic with identity on W-logic in the presence of constants. (shrink)

In this paper, we study the union axiom of ZFC. After a brief introduction, we sketch a proof of the folklore result that union is independent of the other axioms of ZFC. In the third section, we prove some results in the theory T:= ZFC minus union. Finally, we show that the consistency of T plus the existence of an inaccessible cardinal proves the consistency of ZFC.

We discuss in this paper the scope of abduction in Economics. The literature on this type of inference shows that it can be interpreted in different ways, according to the role and nature of its outcome. We present a formal model that allows to capture these various meanings in different economic contexts.

The use of tensed language and the metaphor of set ‘formation’ found in informal descriptions of the iterative conception of set are seldom taken at all seriously. Both are eliminated in the nonmodal stage theories that formalise this account. To avoid the paradoxes, such accounts deny the Maximality thesis, the compelling thesis that any sets can form a set. This paper seeks to save the Maximality thesis by taking the tense more seriously than has been customary (although not literally). A (...) modal stage theory, MST, is developed in a bimodal language, governed by a tenselike logic. Such a language permits a very natural axiomatisation of the iterative conception, which upholds the Maximality thesis. It is argued that the modal approach is consonant with mathematical practice and a plausible metaphysics of sets and shown that MST interprets a natural extension of Zermelo set theory less the axiom of Infinity and, when extended with a further axiom concerning the extent of the hierarchy, interprets Zermelo–Fraenkel set theory. (shrink)

This paper is dedicated to Alonzo Church, who died in August 1995 after a long life devoted to logic. To Church we owe lambda calculus, the thesis bearing his name and the solution to the Entscheidungsproblem.His well-known book Introduction to Mathematical LogicI, defined the subject matter of mathematical logic, the approach to be taken and the basic topics addressed. Church was the creator of the Journal of Symbolic Logicthe best-known journal of the area, which he edited for several decades This (...) paper is in three sections. The first is written in journalistic style:the story of the life of AlonzoChurch is told, including some of the many anecdotes I have collected from different sources. The secondpart is devoted to his work, but is far from being exhaustive. The last part is more original; in it I attempto show that Church’s great discovery was lambda calculus and that his remaining contributions weremainly inspired afterthoughts in the sense that most of his contributions as well as some of his pupils derivefrom that initial achievement. Included are Kleene’s Recursion Theory and the completeness proof ofHenkin. I have added an appendix in which is presented the typed lambda calculus and a proof of theundecidability of first-order logic. (shrink)

Proofs of Gödel's First Incompleteness Theorem are often accompanied by claims such as that the gödel sentence constructed in the course of the proof says of itself that it is unprovable and that it is true. The validity of such claims depends closely on how the sentence is constructed. Only by tightly constraining the means of construction can one obtain gödel sentences of which it is correct, without further ado, to say that they say of themselves that they are unprovable (...) and that they are true; otherwise a false theory can yield false gödel sentences. (shrink)

Scientific knowledge develops in an increasingly fragmentary way.A multitude of scientific disciplines branch out. Curiosity for thisdevelopment leads into quests for a unifying understanding. To a certain extent, foundational studies provide such unification. There is a tendency, however, also of a fragmentary growth of foundational studies, like in a multitude of disciplinaryfoundations. We suggest to look at the foundational problem, not primarily as a search for foundations for one discipline in another, as in some reductionist approach, but as a steady (...) revelation ofpresuppositions for individual scientific theories – which are boundto meet, sooner or later, in a common language. A decisive point hereis our holistic conception of language, as a whole of description-interpretation processes which are entangled(complementary) in the language itself. For every language there is alinguistic complementarity. We suggest this unique form ofentanglement as a unifying presupposition, ultimately foundational forall communicable knowledge. Involved is a linguistic realism, in terms ofwhich we critically examine ``language-world'' problems, as exposed byWittgenstein, and Russell, about a foundational interdependence of language andreality (world). Throughout, we attach to the developmentof foundational studies of mathematics, logics, and the naturalsciences. In particular, we study the interpretation problem foraxioms of infinity in some detail. We emphasize that the holistic concept of language contradicts Carnap's semiotic fragmentation thesis (thus, no clean cutbetween syntax, semantics, pragmatics). (shrink)

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of structures in (...) contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented. (shrink)

Alonzo Church (1903–1995) was a renowned mathematical logician, philosophical logician, philosopher, teacher and editor. He was one of the founders of the discipline of mathematical logic as it developed after Cantor, Frege and Russell. He was also one of the principal founders of the Association for Symbolic Logic and the Journal of Symbolic Logic. The list of his students, mathematical and philosophical, is striking as it contains the names of renowned logicians and philosophers. In this article, we focus primarily on (...) Church’s philosophical contributions. (For an account of his life and academic history see the Introduction to The Collected Works of Alonzo Church (2019).) However, we also discuss his mathematical results when it is desirable to do so in order to pursue a philosophical issue. (shrink)

The question that is the subject of this article is not intended to be a sociological or statistical question about the practice of today’s mathematicians, but a philosophical question about the nature of mathematics, and specifically the method of mathematics. Since antiquity, saying that mathematics is problem solving has been an expression of the view that the method of mathematics is the analytic method, while saying that mathematics is theorem proving has been an expression of the view that the method (...) of mathematics is the axiomatic method. In this article it is argued that these two views of the mathematical method are really opposed. In order to answer the question whether mathematics is problem solving or theorem proving, the article retraces the Greek origins of the question and Hilbert’s answer. Then it argues that, by Gödel’s incompleteness results and other reasons, only the view that mathematics is problem solving is tenable. (shrink)

An oversight in Guaspari and Solovay’s “Rosser sentences” [D. Guaspari, R.M. Solovay, Rosser sentences, Annals of Mathematical Logic 16 81–99] is pointed out and emended. It concerns the premisses of their proof that there are standard proof predicates all of whose Rosser sentences are provably equivalent. The result holds up, but the premisses mentioned in the paper have to be strengthened somewhat.

LetA H be the Herbrand normal form ofA andA H,D a Herbrand realization ofA H. We showThere is an example of an (open) theory ℐ+ with function parameters such that for someA not containing function parameters Similar for first order theories ℐ+ if the index functions used in definingA H are permitted to occur in instances of non-logical axiom schemata of ℐ, i.e. for suitable ℐ,A In fact, in (1) we can take for ℐ+ the fragment (Σ 1 0 -IA)+ (...) of second order arithmetic with induction restricted toΣ 1 0 -formulas, and in (2) we can take for ℐ the fragment (Σ 1 0,b -IA) of first order arithmetic with induction restricted to formulas VxA(x) whereA contains only bounded quantifiers.On the other hand, $$PA^2 \vdash A^H \Rightarrow PA \vdash A,$$ wherePA 2 is the extension of first order arithmeticPA obtained by adding quantifiers for functions andA∈ℒ(PA). This generalizes to extensional arithmetic in the language of all finite types but not to sentencesA with positively occurring existential quantifiers for functions. (shrink)

This article develops a critical investigation of the epistemological core of Hilbert's foundational project, the so-called the finitary attitude. The investigation proceeds by distinguishing different senses of 'number' and 'finitude' that have been used in the philosophical arguments. The usual notion of modern pure mathematics, i.e. the sense of number which is implicit in the notion of an arbitrary finite sequence and iteration is one sense of number and finitude. Another sense, of older origin, is connected with practices of counting (...) concrete things, and a third sense is linked up with the immediate intuitive experience of multitudes of concrete things. Hilbert's fìnitism is examined with respect to these differences, and it will be shown that there is a tendency to conflate the different senses of number and fìnitude, a tendency which has been a source of problems in the discussion of the foundations of mathematics and in the philosophy of logic and language. (shrink)

This paper addresses John Burgess's answer to the ‘Benacerraf Problem’: How could we come justifiably to believe anything implying that there are numbers, given that it does not make sense to ascribe location or causal powers to numbers? Burgess responds that we should look at how mathematicians come to accept: There are prime numbers greater than 1010 That, according to Burgess, is how one can come justifiably to believe something implying that there are numbers. This paper investigates what lies behind (...) Burgess's answer and ends up as a rebuttal to Burgess's reasoning. (shrink)

Arnold Cusmariu ABSTRACT: The Cogito formulation in Discourse on Method attributes properties to one conceptual category that belong to another. Correcting the error ends up defeating Descartes’ response to skepticism. His own creation, the Evil Genius, is to blame. Download PDF.

In the basic modal language and in the basic modal language with the added universal modality, first-order definability of all formulas over the class of all frames is shown. Also, it is shown that the problems of modal definability of first-order sentences over the class of all frames in the languages and are both PSPACE-complete.

This paper is a summary of a lecture in which I presented some remarks on Gödel’s incompleteness theorems and their meaning for the foundations of physics. The entire lecture will appear elsewhere. doi: http://dx.doi.org/ 10.5007 / 1808-1711.2011v15n3p453.