Is second-order logic logic? Famously Quine argued second-order logic wasn't logic but his arguments have been the subject of influential criticisms. In the early sections of this paper, I develop a deeper perspective upon Quine's philosophy of logic by exploring his positive conception of what logic is for and hence what logic is. Seen from this perspective, I argue that many of the criticisms of his case against second- (...) class='Hi'>order logic miss their mark. Then, in the later sections, I go beyond Quine to develop a novel case that quantification into polyadic predicate position, understood as requiring quantifiers to range over relations, isn't intelligible. (shrink)

“Second-order Logic” in Anderson, C.A. and Zeleny, M., Eds. Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Dordrecht: Kluwer, 2001. Pp. 61–76. -/- Abstract. This expository article focuses on the fundamental differences between second- order logic and first-order logic. It is written entirely in ordinary English without logical symbols. It employs second-order propositions and second-order reasoning in a natural way to illustrate the fact that (...) class='Hi'>second-order logic is actually a familiar part of our traditional intuitive logical framework and that it is not an artificial formalism created by specialists for technical purposes. To illustrate some of the main relationships between second-order logic and first-order logic, this paper introduces basic logic, a kind of zero-order logic, which is more rudimentary than first-order and which is transcended by first-order in the same way that first-order is transcended by second-order. The heuristic effectiveness and the historical importance of second-order logic are reviewed in the context of the contemporary debate over the legitimacy of second-order logic. Rejection of second-order logic is viewed as radical: an incipient paradigm shift involving radical repudiation of a part of our scientific tradition, a tradition that is defended by classical logicians. But it is also viewed as reactionary: as being analogous to the reactionary repudiation of symbolic logic by supporters of “Aristotelian” traditional logic. But even if “genuine” logic comes to be regarded as excluding second-order reasoning, which seems less likely today than fifty years ago, its effectiveness as a heuristic instrument will remain and its importance for understanding the history of logic and mathematics will not be diminished. Second-order logic may someday be gone, but it will never be forgotten. Technical formalisms have been avoided entirely in an effort to reach a wide audience, but every effort has been made to limit the inevitable sacrifice of rigor. People who do not know second-order logic cannot understand the modern debate over its legitimacy and they are cut-off from the heuristic advantages of second-order logic. And, what may be worse, they are cut-off from an understanding of the history of logic and thus are constrained to have distorted views of the nature of the subject. As Aristotle first said, we do not understand a discipline until we have seen its development. It is a truism that a person's conceptions of what a discipline is and of what it can become are predicated on their conception of what it has been. (shrink)

Neo-Fregean approaches to set theory, following Frege, have it that sets are the extensions of concepts, where concepts are the values of second-order variables. The idea is that, given a second-order entity $X$, there may be an object $\varepsilon X$, which is the extension of X. Other writers have also claimed a similar relationship between second-order logic and set theory, where sets arise from pluralities. This paper considers two interpretations of second-order (...) logic—as being either extensional or intensional—and whether either is more appropriate for this approach to the foundations of set theory. Although there seems to be a case for the extensional interpretation resulting from modal considerations, I show how there is no obstacle to starting with an intensional second-order logic. I do so by showing how the $\varepsilon$ operator can have the effect of “extensionalizing” intensional second-order entities. (shrink)

Provided here is an account, both syntactic and semantic, of first-order and monadic second-order quantification theory for domains that may be non-atomic. Although the rules of inference largely parallel those of classical logic, there are important differences in connection with the identification of argument places and the significance of the identity relation.

In a first part, I defend that formal semantics can be used as a guide to ontological commitment. Thus, if one endorses an ontological view \(O\) and wants to interpret a formal language \(L\) , a thorough understanding of the relation between semantics and ontology will help us to construct a semantics for \(L\) in such a way that its ontological commitment will be in perfect accordance with \(O\) . Basically, that is what I call constructing formal semantics from an (...) ontological perspective. In the rest of the paper, I develop rigorously and put into practice such a method, especially concerning the interpretation of second-order quantification. I will define the notion of ontological framework: it is a set-theoretical structure from which one can construct semantics whose ontological commitments correspond exactly to a given ontological view. I will define five ontological frameworks corresponding respectively to: (i) predicate nominalism, (ii) resemblance nominalism, (iii) armstrongian realism, (iv) platonic realism, and (v) tropism. From those different frameworks, I will construct different semantics for first-order and second-order languages. Notably I will present different kinds of nominalist semantics for second-order languages, showing thus that we can perfectly quantify over properties and relations while being ontologically committed only to individuals. I will show in what extent those semantics differ from each other; it will make clear how the disagreements between the ontological views extend from ontology to logic, and thus why endorsing an ontological view should have an impact on the kind of logic one should use. (shrink)

In two recent papers, Bob Hale has attempted to free second-order logic of the 'staggering existential assumptions' with which Quine famously attempted to saddle it. I argue, first, that the ontological issue is at best secondary: the crucial issue about second-order logic, at least for a neo-logicist, is epistemological. I then argue that neither Crispin Wright's attempt to characterize a `neutralist' conception of quantification that is wholly independent of existential commitment, nor Hale's attempt to (...) characterize the second-order domain in terms of definability, can serve a neo-logicist's purposes. The problem, in both cases, is similar: neither Wright nor Hale is sufficiently sensitive to the demands that impredicativity imposes. Finally, I defend my own earlier attempt to finesse this issue, in "A Logic for Frege's Theorem", from Hale's criticisms. (shrink)

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

In the language of second-order logic, first- and second-order variables are distinguished syntactically and cannot be grammatically substituted. According to a prominent argument for the deployment of these languages, these substitution failures are necessary to block the derivation of paradoxes that result from attempts to generalize over predicate interpretations. I first examine previous approaches which interpret second-order sentences using expressions of natural language and argue that these approaches undermine these syntactic restrictions. I then (...) examine Williamson’s primitivist approach according to which second-order sentences are not offered readings in a previously understood language. I argue that the syntactic restrictions alone do not block the derivation of the paradox, unless they are backed by a principled reason that the language cannot be expanded to allow the grammatical substitution of first- and second- order variables. I argue that there is neither a syntactic nor a semantic principle that prohibits such an expansion. (shrink)

Here's the thing: when you look at it from just the right angle, it's entirely obvious how semantics for second-order relevant logics ought to go. Or at least, if you've understood how semantics for first-order relevant logics ought to go, there are perspectives like this. What's more is that from any such angle, the metatheory that needs doing can be summed up in one line: everything is just as in the first-order case, but with more indices. (...) Of course, it's no small matter finding the magical angle from which everything becomes obvious. And even having found this perspective, one cannot assume one's audience will find things as obvious as oneself. All that to say this: if the results in the paper below strike you as obvious, pay attention to the perspective that makes that possible. And if they don't, feel free to ignore this preamble in its entirety. (shrink)

We extend Barbanera and Berardi's symmetric lambda calculus [2] to second-order classical propositional logic and prove its strong normalization.

examine Nathan Salmon’s solution to the problem of trivialization, as it arises for conceptions of general term rigidity that construe it as identity of designation across possible worlds. I argue that he does not succeed in showing that some alleged general terms, such as “the colour of the sky” are non-rigid, but also that a small class of different examples that he presents, which can be construed as second order descriptions, are indeed non-rigid general terms, although for reasons (...) different from those he thought. (shrink)

A number of widely discussed court decisions on cases of insults against religious feelings in Russia, such as the relatively recent “Pokemon Go” case of blogger Ruslan Sokolovsky or the lawsuit filed against an Orthodox priest by Nikolai Ryabchevsky in Yekaterinburg for comparing Lenin with Hitler, make pertinent the question of why toleration becomes so difficult in matters concerning religion. In this paper, I revise the classical liberal concept of toleration (David Heyd, Peter Nicholson, and John Horton), arguing that it (...) is challenged by contemporary philosophers, who see no room for applying this concept in the “domain of identities”. The most prominent case of “primordial” identity, that is, the notion of identity as a given, is the claim of devoted believers for recognition. Should we replace the principle of toleration by the principle of recognition since the latter better corresponds to identity claims? To address this question, in the first part of the article I describe the mechanism of tolerant attitude (Nicholson, Heyd) and in the second part, I analyze the debates about the possibility or impossibility of inner religious toleration (Avishai Margalit, Cary Nederman, and Maxim Khomyakov) and further compare toleration and recognition as normative principles. In the light of the debates I took part in the conference hosted by the University of Southern Denmark in October 2019 as part of the project “Religious Majority/Minority in Public Space in Russia and Northern Europe: Historical-Cultural Analysis”, I come to the conclusion that the principle of toleration is preferable to the principle of recognition because the “second-order” arguments for toleration in a secular state will be universally acceptable (pragmatic argument) and, therefore, the principle of toleration is more logical (analytical argument). Following Peter John’s thesis about minimal recognition embedded in toleration, it may also be concluded that we need a normatively charged idea of citizenship, which could provide us with universal “second-order” foundation. (shrink)

The paper sets forth an argument against Kim's distinction between levels and orders.

W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due in (...) large measure to developments stemming from Carnap’s studies and culminating in the work of Kripke, Hintikka, and Bayart. These developments undermined Quine’s crusade against intensions on two fronts. First, in the context of possible world semantics, intensions could after all be given rigorous identity conditions by defining them (in the simplest case) as functions from worlds to appropriate extensions, a fact exploited to powerful and influential effect in logic and linguistics by the likes of Kaplan, Montague, Lewis, and Cresswell. Second, the rise of possible world semantics fueled a strong resurgence of metaphysics in contemporary analytic philosophy that saw properties and propositions widely, fruitfully, and unabashedly adopted as ontological primitives in their own right. This resurgence — happily, in my view — continues into the present day. -/- For a time, at any rate, Quine experienced somewhat better success with his second thesis: that higher-order logic is, at worst, confused and, at best, a quirky notational alternative to standard first-order logic. However, Quine notwithstanding, a great deal of recent work in formal metaphysics transpires in a higher-order logical framework in which properties and propositions fall into an infinite hierarchy of types of (at least) every finite order. Initially, the most philosophically compelling reason for embracing such a framework since Russell first proposed his simple theory of types was simply that it provides a relatively natural explanation of the paradoxes. However, since the seminal work of Prior there has been a growing trend to consider higher-order logic to be the most philosophically natural framework for metaphysical inquiry, many of the contributors to this volume being among the most important and influential advocates of this view. Indeed, this is now quite arguably the dominant view among formal metaphysicians. -/- In this paper, and against the current tide, I will argue in §1 that there are still good reasons to think that Quine’s second battle is not yet lost and that the correct framework for logic is first-order and type-free — properties and propositions, logically speaking, are just individuals among others in a single domain of quantification — and that it arises naturally out of our most basic logical and semantical intuitions. The data I will draw upon are not new and are well-known to contemporary higher-order metaphysicians. However, I will try to defend my thesis in what I believe is a novel way by suggesting that these basic intuitions ground a reasonable distinction between “pure” logic and non-logical theory, and that Russell-style semantic paradoxes of truth and exemplification arise only when we move beyond the purely logical and, hence, do not of themselves provide any strong objection to a type-free conception of properties and propositions. -/- Most of my arguments in §1 are largely independent of any specific account of the nature of properties and propositions beyond their type-freedom. However, I will in addition argue that there are good reasons to take propositions, at least, to be very fine-grained. My arguments are thus bolstered significantly if it can be shown that there are in fact well-defined examples of logics that are not only type-free but which comport with such a conception of propositions. It is the purpose of §2 to lay out a logic of this sort in some detail, drawing especially upon work by George Bealer and related work of my own. With the logic in place, it will be possible to generalize the line of argument noted above regarding Russell-style paradoxes and, in §3, apply it to two propositional paradoxes — the Prior-Kaplan paradox and the Russell-Myhill paradox — that are often taken to threaten the sort of account developed here. (shrink)

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what (...) may be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then 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. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)

This book develops a new approach to plural arbitrary reference and examines mereology, including considering four theses on the alleged innocence of mereology. The authors have advanced the notion of plural arbitrary reference in terms of idealized plural acts of choice, performed by a suitable team of agents. In the first part of the book, readers will discover a revision of Boolosʼ interpretation of second order logic in terms of plural quantification and a sketched structuralist reconstruction of (...) second-order arithmetic based on the axiom of infinite, a la Dedekind, as the unique non-logical axiom. The work goes on to analyse the pros and cons of the new interpretation, also with respect to Linneboʼs objections to the thesis that second order logic is genuine logic. A theory of concepts that can be labelled as a theory of logical concepts is expounded. In the second part of the book, the authors consider grounding megethology on plural arbitrary reference and argue that the arguments for the ontological innocence of mereology are not conclusive and that – for a certain use of mereology – a thesis of innocence, similar to that of plural arbitrary reference, is defensible. The work proposes a virtual theory of mereology in which the role of individuals is played by plural choices of atoms. This considered work will appeal to scholars from branches of analytic philosophy, logic and the philosophy of mathematics in particular. (shrink)

The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only (...) a few rudimentary facts of arithmetic are logically derivable from Hume’s Principle. And that hardly counts as a vindication of logicism. (shrink)

Beginning with a survey of the shortcoming of theories of organology/media-as-externalization of mind/body—a philosophical-anthropological tradition that stretches from Plato through Ernst Kapp and finds its contemporary proponent in Bernard Stiegler—I propose that the phenomenological treatment of media as an outpouching and extension of mind qua intentionality is not sufficient to counter the ̳black-box‘ mystification of today‘s deep learning‘s algorithms. Focusing on a close study of Simondon‘s On the Existence of Technical Objectsand Individuation, I argue that the process-philosophical work of Gilbert (...) Simondon, with its critique of Norbert Wiener‘s first-order cybernetics, offers a precursor to the conception of second-order cybernetics (as endorsed byFrancisco Varela, Humberto Maturana, and Ricardo B. Uribe) and, specifically, its autopoietic treatment of information. It has been argued by those such as Frank Pasquale that neuro-inferential deep learning systems premised on predictive patterning, suchas AlphaGo Zero, have a veiled logic and, thus, are ̳black boxes‘. In detailing a philosophical-historical approach to demystify predictive patterning/processing and the logic of such deep learning algorithms, this paper attempts to shine a light on such systems and their inner workingsàla Simondon. (shrink)

A famous passage in Section 64 of Frege’s Grundlagen may be seen as a justification for the truth of abstraction principles. The justification is grounded in the procedureofcontent recarvingwhich Frege describes in the passage. In this paper I argue that Frege’sprocedure of content recarving while possibly correct in the case of first-order equivalencerelations is insufficient to grant the truth of second-order abstractions. Moreover, I propose apossible way of justifying second-order abstractions by referring to the operation (...) of contentrecarving and I show that the proposal relies to a certain extent on the Basic Law V. Therefore,if we are to justify the truth of second-order abstractions by invoking the content recarvingprocedure we are committed to a special status of some instances of the Basic Law V and thusto a special status of extensions of concepts as abstract objects. (shrink)

The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict between the neutrality of second-order logic and its alleged entanglement with mathematics. Some cases of this conflict concern small large cardinals. In this article, we show that in these cases the conflict can be resolved by moving from a set-theoretic implementation (...) of the model-theoretic account to one which uses higher-order resources. (shrink)

Many theories of rational belief give a special place to logic. They say that an ideally rational agent would never be uncertain about logical facts. In short: they say that ideal rationality requires "logical omniscience." Here I argue against the view that ideal rationality requires logical omniscience on the grounds that the requirement of logical omniscience can come into conflict with the requirement to proportion one’s beliefs to the evidence. I proceed in two steps. First, I rehearse an influential (...) line of argument from the "higher-order evidence" debate, which purports to show that it would be dogmatic, even for a cognitively infallible agent, to refuse to revise her beliefs about logical matters in response to evidence indicating that those beliefs are irrational. Second, I defend this "anti-dogmatism" argument against two responses put forth by Declan Smithies and David Christensen. Against Smithies’ response, I argue that it leads to irrational self-ascriptions of epistemic luck, and that it obscures the distinction between propositional and doxastic justification. Against Christensen’s response, I argue that it clashes with one of two attractive deontic principles, and that it is extensionally inadequate. Taken together, these criticisms will suggest that the connection between logic and rationality cannot be what it is standardly taken to be—ideal rationality does not require logical omniscience. (shrink)

This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The categorical duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The hyperintensional profile of $\Omega$-logical validity can then be countenanced within a coalgebraic logic. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal and hyperintensional profiles of $\Omega$-logical validity correspond to those of second-order logical consequence, (...) $\Omega$-logical validity is genuinely logical. Second, the foregoing provides a hyperintensional account of the interpretation of mathematical and metamathematical vocabulary. (shrink)

A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood. In the first part of the article, we examine the argument and locate its main source, namely, the alleged entanglement of second-order logic and mathematics. We then identify various reasons why the entanglement may be thought to be problematic. In the second part of the article, we (...) take a metatheoretic perspective on the matter. We prove a number of results establishing that the entanglement is sensitive to the kind of semantics used for second-order logic. These results provide evidence that by moving from the standard set-theoretic semantics for second-order logic to a semantics which makes use of higher-order resources, the entanglement either disappears or may no longer be in conflict with the logicality of second-order logic. (shrink)

This paper deals with higher-order vagueness in Williamson's 'logic of clarity'. Its aim is to prove that for 'fixed margin models' (W,d,α ,[ ]) the notion of higher-order vagueness collapses to second-order vagueness. First, it is shown that fixed margin models can be reformulated in terms of similarity structures (W,~). The relation ~ is assumed to be reflexive and symmetric, but not necessarily transitive. Then, it is shown that the structures (W,~) come along with naturally (...) defined maps h and s that define a Galois connection on the power set PW of W. These maps can be used to define two distinct boundary operators bd and BD on W. The main theorem of the paper states that higher-order vagueness with respect to bd collapses to second-order vagueness. This does not hold for BD, the iterations of which behave in quite an erratic way. In contrast, the operator bd defines a variety of tolerance principles that do not fall prey to the sorites paradox and, moreover, do not always satisfy the principles of positive and negative introspection. (shrink)

Since Benacerraf’s ‘What Numbers Could Not Be, ’ there has been a growing interest in mathematical structuralism. An influential form of mathematical structuralism, modal structuralism, uses logical possibility and second order logic to provide paraphrases of mathematical statements which don’t quantify over mathematical objects. These modal structuralist paraphrases are a useful tool for nominalists and realists alike. But their use of second order logic and quantification into the logical possibility operator raises concerns. In this (...) paper, I show that the work of both these elements can be done by a single natural generalization of the logical possibility operator. (shrink)

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

It has long been known that in the context of axiomatic second-order logic (SOL), Hume's Principle (HP) is mutually interpretable with "the universe is Dedekind infinite" (DI). I offer a more fine-grained analysis of the logical strength of HP, measured by deductive implications rather than interpretability. The main result is that HP is not deductively conservative over SOL + DI. That is, SOL + HP proves additional theorems in the language of pure second-order logic (...) that are not provable from SOL + DI alone. Arguably, then, HP is not just a pure axiom of infinity, but rather it carries additional logical content. On the other hand, I show that HP is $\Pi^1_1$ conservative over SOL + DI, and that HP is conservative over SOL + DI + "the universe is well ordered" (WO). Next, I show that SOL + HP does not prove any of the simplest and most natural versions of the axiom of choice, including WO and weaker principles. Lastly, I discuss other axioms of infinity. I show that HP does not prove the Splitting or Pairing principles (axioms of infinity stronger than DI). (shrink)

The first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete linear time) and trees of ω-segments (linear time with branching gaps) and some of its fragments are compared: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.

Higher-order realists about properties express their view that there are properties with the help of higher-order rather than first-order quantifiers. They claim two types of advantages for this way of formulating property realism. First, certain gridlocked debates about the nature of properties, such as the immanentism versus transcendentalism dispute, are taken to be dissolved. Second, a further such debate, the tropes versus universals dispute, is taken to be resolved. In this paper I first argue that higher- (...) class='Hi'>order realism does not in fact resolve the tropes versus universals dispute. In a constructive spirit, I then develop higher-order realism in a way that leads to a dissolution, rather than a resolution, of this dispute too. (shrink)

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By (...) bringing considerations of perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in Göttingen in 1921 with a thesis on the decision problem. In his thesis, he solved - independently of Löwenheim and Skolem's earlier work - the decision problem for monadic second-order logic in a framework that combined elements of the algebra of logic and the newer axiomatic approach to logic then being developed in Göttingen. In a talk given in 1921, he outlined this solution, but also (...) presented important programmatic remarks on the significance of the decision problem and of decision procedures more generally. The text of this talk as well as a partial English translation are included. (shrink)

One of the philosophical uses of Dedekind’s categoricity theorem for Peano Arithmetic is to provide support for semantic realism. To this end, the logical framework in which the proof of the theorem is conducted becomes highly significant. I examine different proposals regarding these logical frameworks and focus on the philosophical benefits of adopting open-ended schemas in contrast to second order logic as the logical medium of the proof. I investigate Pederson and Rossberg’s critique of the ontological advantages (...) of open-ended arithmetic when it comes to establishing the categoricity of Peano Arithmetic and show that the critique is highly problematic. I argue that Pederson and Rossberg’s ontological criterion deliver the bizarre result that certain first order subsystems of Peano Arithmetic have a second order ontology. As a consequence, the application of the ontological criterion proposed by Pederson and Rossberg assigns a certain type of ontology to a theory, and a different, richer, ontology to one of its subtheories. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, (...) and the modal operators regimenting the notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

Jim Sterba’s Is a Good God Logically Possible? looks to resurrect J. L. Mackie’s logical argument from evil. Sterba accepts the general framework that theists seeking to give a theodicy have favored since Leibniz invented the term: the search for some greater good provided or greater evil averted that would justify God in permitting the type and variety of evil we actually observe. However, Sterba introduces a deontic twist, drawing on the Pauline Principle (let us not do evil that good (...) may come) to introduce three deontic side constraints on God’s choice of action. He then splits the possible goods into four categories: first- vs. second-order goods, goods to which we have a right, and goods to which we do not have a right. He argues that his deontic constraints rule out each combination, thereby showing that no God-justifying good is on offer. To defuse the argument, I draw on a pair of ideas from Marilyn McCord Adams: (i) God is outside the bounds of morality, and (ii) God can defeat evils by incorporating them into an incommensurately valuable friendship with each human. Properly appreciated, these show that the new logical argument relies on a false premise that is not easily repaired. (shrink)

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any (...) advantages when dealing with the so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (shrink)

Bob Hale’s distinguished record of research places him among the most important and influential contemporary analytic metaphysicians. In his deep, wide ranging, yet highly readable book Necessary Beings, Hale draws upon, but substantially integrates and extends, a good deal his past research to produce a sustained and richly textured essay on — as promised in the subtitle — ontology, modality, and the relations between them. I’ve set myself two tasks in this review: first, to provide a reasonably thorough (if not (...) exactly comprehensive) overview of the structure and content of Hale’s book and, second, to a limited extent, to engage Hale’s book philosophically. I approach these tasks more or less sequentially: Parts I and 2 of the review are primarily expository; in Part 3 I adopt a somewhat more critical stance and raise several issues concerning one of the central elements of Hale’s account, his essentialist theory of modality. (shrink)

For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of (...) deBouvere]. It is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are definitionally equivalent with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories. (shrink)

Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...) and meta-theoretic properties when comparing first-order and second-order logic. (shrink)

You have higher-order uncertainty iff you are uncertain of what opinions you should have. I defend three claims about it. First, the higher-order evidence debate can be helpfully reframed in terms of higher-order uncertainty. The central question becomes how your first- and higher-order opinions should relate—a precise question that can be embedded within a general, tractable framework. Second, this question is nontrivial. Rational higher-order uncertainty is pervasive, and lies at the foundations of the epistemology (...) of disagreement. Third, the answer is not obvious. The Enkratic Intuition---that your first-order opinions must “line up” with your higher-order opinions---is incorrect; epistemic akrasia can be rational. If all this is right, then it leaves us without answers---but with a clear picture of the question, and a fruitful strategy for pursuing it. (shrink)

This chapter explores the metaphysical views about higher-order logic held by two individuals responsible for introducing it to philosophy: Gottlob Frege (1848–1925) and Bertrand Russell (1872–1970). Frege understood a function at first as the remainder of the content of a proposition when one component was taken out or seen as replaceable by others, and later as a mapping between objects. His logic employed second-order quantifiers ranging over such functions, and he saw a deep division in (...) nature between objects and functions. Russell understood propositional functions as what is obtained when constituents of propositions are replaced by variables, but eventually denied that they were entities in their own right. Both encountered contradictions when supposing there to exist as many objects as functions, and both adopted views about the meaningfulness of higher-order discourse that were difficult to state from within their own strictures. (shrink)

Interesting as they are by themselves in philosophy and mathematics, paradoxes can be made even more fascinating when turned into proofs and theorems. For example, Russell’s paradox, which overthrew Frege’s logical edifice, is now a classical theorem in set theory, to the effect that no set contains all sets. Paradoxes can be used in proofs of some other theorems—thus Liar’s paradox has been used in the classical proof of Tarski’s theorem on the undefinability of truth in sufficiently rich languages. This (...) paradox (as well as Richard’s paradox) appears implicitly in Gödel’s proof of his celebrated first incompleteness theorem. In this paper, we study Yablo’s paradox from the viewpoint of first- and second-order logics. We prove that a formalization of Yablo’s paradox (which is second order in nature) is non-first-orderizable in the sense of George Boolos (1984). (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second- (...) class='Hi'>order and Zermelo’s quasi-categoricity theorem for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order (classical) systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

Most descriptions of higher-order vagueness in terms of traditional modal logic generate so-called higher-order vagueness paradoxes. The one that doesn't is problematic otherwise. Consequently, the present trend is toward more complex, non-standard theories. However, there is no need for this.In this paper I introduce a theory of higher-order vagueness that is paradox-free and can be expressed in the first-order extension of a normal modal system that is complete with respect to single-domain Kripke-frame semantics. This is (...) the system QS4M+BF+FIN. It corresponds to the class of transitive, reflexive and final frames. With borderlineness defined logically as usual, it then follows that something is borderline precisely when it is higher-order borderline, and that a predicate is vague precisely when it is higher-order vague.Like Williamson's, the theory proposed here has no clear borderline cases in Sorites sequences. I argue that objections that there must be clear borderline cases ensue from the confusion of two notions of borderlineness—one associated with genuine higher-order vagueness, the other employed to sort objects into categories—and that the higher-order vagueness paradoxes result from superimposing the second notion onto the first. Lastly, I address some further potential objections. (shrink)

Higher‐order metaphysicians take facts to be higher‐order beings, i.e., entities in the range of irreducibly higher‐order quantifiers. In this paper, I investigate the impact of this conception of facts on the debate about the reality of tense. I identify two major repercussions. The first concerns the logical space of tense realism: on a higher‐order conception of facts, a prominent version of tense realism, dynamic absolutism, turns out to conflict with the laws of (higher‐order tense) (...) class='Hi'>logic. The second concerns our understanding of the positions occupying this logical space: on a higher‐order conception of facts, an attractive interpretation of the central tense realist notion of ‘facts constituting reality’ becomes unavailable. I discuss these results in the context of the more general project of higher‐order metaphysics and the (meta)metaphysics of time, drawing out their implications for the nature of the disputes both between realists and anti‐realists about tense and between different tense realist factions. (shrink)

The paper proposes two logical analyses of (the norms of) justification. In a first, realist-minded case, truth is logically independent from justification and leads to a pragmatic logic LP including two epistemic and pragmatic operators, namely, assertion and hypothesis. In a second, antirealist-minded case, truth is not logically independent from justification and results in two logical systems of information and justification: AR4 and AR4¢, respectively, provided with a question-answer semantics. The latter proposes many more epistemic agents, each corresponding (...) to a wide variety of epistemic norms. After comparing the different norms of justification involved in these logical systems, two hexagons expressing Aristotelian relations of opposition will be gathered in order to clarify how (a fragment of) pragmatic formulas can be interpreted in a fuzzy-based question-answer semantics. (shrink)

This paper analyses a hitherto unknown technique of using logic diagrams to create argument maps in eristic dialectics. The method was invented in the 1810s and -20s by Arthur Schopenhauer, who is considered the originator of modern eristic. This technique of Schopenhauer could be interesting for several branches of research in the field of argumentation: Firstly, for the field of argument mapping, since here a hitherto unknown diagrammatic technique is shown in order to visualise possible situations of arguments (...) in a dialogical controversy. Secondly, the art of controversy or eristic, since the diagrams do not analyse the truth of judgements and the validity of inferences, but the persuasiveness of arguments in a dialogue. (shrink)

In the course of proving a tenability result about the probabilities of conditionals, van Fraassen (1976) introduced a semantics for conditionals based on ω-sequences of worlds, which amounts to a particularly simple special case of ordering semantics for conditionals. On that semantics, ‘If p, then q’ is true at an ω-sequence just in case q is true at the first tail of the sequence where p is true (if such a tail exists). This approach has become increasingly popular in recent (...) years. However, its logic has never been explored. We axiomatize the logic of ω-sequence semantics, showing that it is the result of adding two new axioms to Stalnaker’s logic C2: one, Flattening, which is prima facie attractive, and, and a second, Sequentiality, which is complex and difficult to assess, but, we argue, likely invalid. But we also show that when sequence semantics is generalized from ω-sequences to arbitrary (transfinite) ordinal sequences, the result is a more attractive logic that adds only Flattening to C2. We also explore the logics of a few other interesting restrictions of ordinal sequence semantics. Finally, we address the question of whether sequence semantics is motivated by probabilistic considerations, answering, pace van Fraassen, in the negative. (shrink)