Defending or attacking either functionalism or computationalism requires clarity on what they amount to and what evidence counts for or against them. My goal here is not to evaluate their plausibility. My goal is to formulate them and their relationship clearly enough that we can determine which type of evidence is relevant to them. I aim to dispel some sources of confusion that surround functionalism and computationalism, recruit recent philosophical work on mechanisms and computation to shed light on them, and (...) clarify how functionalism and computationalism may or may not legitimately come together. (shrink)

According to pancomputationalism, everything is a computing system. In this paper, I distinguish between different varieties of pancomputationalism. I find that although some varieties are more plausible than others, only the strongest variety is relevant to the philosophy of mind, but only the most trivial varieties are true. As a side effect of this exercise, I offer a clarified distinction between computational modelling and computational explanation.<br><br>.

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)

This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

This paper discusses the neo-logicist approach to the foundations of mathematics by highlighting an issue that arises from looking at the Bad Company objection from an epistemological perspective. For the most part, our issue is independent of the details of any resolution of the Bad Company objection and, as we will show, it concerns other foundational approaches in the philosophy of mathematics. In the first two sections, we give a brief overview of the "Scottish" neo-logicist school, present a generic form (...) of the Bad Company objection and introduce an epistemic issue connected to this general problem that will be the focus of the rest of the paper. In the third section, we present an alternative approach within philosophy of mathematics, a view that emerges from Hilbert's Grundlagen der Geometrie (1899, Leipzig: Teubner; Foundations of geometry (trans.: Townsend, E.). La Salle, Illinois: Open Court, 1959.). We will argue that Bad Company-style worries, and our concomitant epistemic issue, also affects this conception and other foundationalist approaches. In the following sections, we then offer various ways to address our epistemic concern, arguing, in the end, that none resolves the issue. The final section offers our own resolution which, however, runs against the foundationalist spirit of the Scottish neo-logicist program. (shrink)

The prevalent interpretation of Gödel’s Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices. In this paper I examine the theorem’s dependency regarding Gödel numberings. I introducedeviantnumberings, yielding provability predicates satisfying Löb’s conditions, which result in provable consistency sentences. According to the main result of this paper however, these (...) “counterexamples” do not refute the theorem’s prevalent interpretation, since once a natural class ofadmissiblenumberings is singled out, invariance is maintained. (shrink)

I offer an explication of the notion of computer, grounded in the practices of computability theorists and computer scientists. I begin by explaining what distinguishes computers from calculators. Then, I offer a systematic taxonomy of kinds of computer, including hard-wired versus programmable, general-purpose versus special-purpose, analog versus digital, and serial versus parallel, giving explicit criteria for each kind. My account is mechanistic: which class a system belongs in, and which functions are computable by which system, depends on the system's mechanistic (...) properties. Finally, I briefly illustrate how my account sheds light on some issues in the history and philosophy of computing as well as the philosophy of mind. (shrink)

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

The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over arithmetic but by those over (...) subject matters ‘richer’ than arithmetic, such as set theory. The move to this new formal setting provides deflationists with better defence and brings a broader perspective to the debate. (shrink)

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? Once the question has been properly formulated, the answer turns out to be about as elegant as one could want: Adding a theory of truth to a finitely axiomatized theory T is more or less equivalent to a (...) kind of abstract consistency statement. A large part of the interest of the paper lies in the way syntactic theories are 'disentangled' from object theories. (shrink)

Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...) that this flaw afflicts many proposals discussed in the literature; we defend a new, stable disentangled theory, double second-order arithmetic. (shrink)

This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

In his paper "Undecidability without arithmetization," Andrzej Grzegorczyk introduces a theory of concatenation $\mathsf{TC}$. We show that pairing is not definable in $\mathsf{TC}$. We determine a reasonable extension of $\mathsf{TC}$ that is sequential, that is, has a good sequence coding.

Contrary to common misconceptions, today's logic is not devoid of existential import: the universalized conditional ∀ x [S→ P] implies its corresponding existentialized conjunction ∃ x [S & P], not in all cases, but in some. We characterize the proexamples by proving the Existential-Import Equivalence: The antecedent S of the universalized conditional alone determines whether the universalized conditional has existential import, i.e. whether it implies its corresponding existentialized conjunction.A predicate is an open formula having only x free. An existential-import predicate (...) Q is one whose existentialization, ∃ x Q, is logically true; otherwise, Q is existential-import-free or simply import-free.How abundant or widespread is existential import? How abundant or widespread are existential-import predicates in themselves or in comparison to import-free predicates? We show that existential-import predicates are quite abundant, and no less so than import-free predicates. Existential.. (shrink)

The existence of a close connection between results on axiomatic truth and the analysis of truth-theoretic deflationism is nowadays widely recognized. The first attempt to make such link precise can be traced back to the so-called conservativeness argument due to Leon Horsten, Stewart Shapiro and Jeffrey Ketland: by employing standard Gödelian phenomena, they concluded that deflationism is untenable as any adequate theory of truth leads to consequences that were not achievable by the base theory alone. In the paper I highlight, (...) as Shapiro and Ketland, the irreducible nature of truth axioms with respect to their base theories. But, I argue, this does not immediately delineate a notion of truth playing a substantial role in philosophical or scientific explanations. I first offer a refinement of Hartry Field’s reaction to the conservativeness argument by distinguishing between metatheoretic and object-theoretic consequences of the theory of truth and address some possible rejoinders. In the resulting picture, truth is an irreducible tool for metatheoretic ascent. How robust is this characterizaton? I test it by considering: a recent example, due to Leon Horsten, of the alleged explanatory role played by the truth predicate in the derivation of Fitch’s paradox; an essential weakening of theories of truth analyzed in the first part of the paper. (shrink)

The aim of this paper is to present a new logic-based understanding of the connection between classical kinematics and relativistic kinematics. We show that the axioms of special relativity can be interpreted in the language of classical kinematics. This means that there is a logical translation function from the language of special relativity to the language of classical kinematics which translates the axioms of special relativity into consequences of classical kinematics. We will also show that if we distinguish a class (...) of observers in special relativity and exclude the non-slower-than light observers from classical kinematics by an extra axiom, then the two theories become definitionally equivalent. Furthermore, we show that classical kinematics is definitionally equivalent to classical kinematics with only slower-than-light inertial observers, and hence by transitivity of definitional equivalence that special relativity theory extended with “Ether” is definitionally equivalent to classical kinematics. So within an axiomatic framework of mathematical logic, wee xplicitly show that the transition from classical kinematics to relativistic kinematics is the knowledge acquisition that there is no “Ether”, accompanied by a redefinition of the concepts of time and space. (shrink)

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 investigates a set of issues connected with the so-called conservativeness argument against deflationism. Although I do not defend that argument, I think the discussion of it has raised some interesting questions about whether what I call “compositional principles,” such as “a conjunction is true iff its conjuncts are true,” have substantial content or are in some sense logically trivial. The paper presents a series of results that purport to show that the compositional principles for a first-order language, taken (...) together, have substantial logical strength, amounting to a kind of abstract consistency statement. (shrink)

The five English words—sentence, proposition, judgment, statement, and fact—are central to coherent discussion in logic. However, each is ambiguous in that logicians use each with multiple normal meanings. Several of their meanings are vague in the sense of admitting borderline cases. In the course of displaying and describing the phenomena discussed using these words, this paper juxtaposes, distinguishes, and analyzes several senses of these and related words, focusing on a constellation of recommended senses. One of the purposes of this paper (...) is to demonstrate that ordinary English properly used has the resources for intricate and philosophically sound investigation of rather deep issues in logic and philosophy of language. No mathematical, logical, or linguistic symbols are used. Meanings need to be identified and clarified before being expressed in symbols. We hope to establish that clarity is served by deferring the extensive use of formalized or logically perfect languages until a solid “informal” foundation has been established. Questions of “ontological status”—e.g., whether propositions or sentences, or for that matter characters, numbers, truth-values, or instants, are “real entities”, are “idealizations”, or are “theoretical constructs”—plays no role in this paper. As is suggested by the title, this paper is written to be read aloud. -/- I hope that reading this aloud in groups will unite people in the enjoyment of the humanistic spirit of analytic philosophy. (shrink)

The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. (...) It is suggested in Section 3 that a central item was the problem of generalizing Gödel's incompleteness theorem. It is shown that this involved both the characterization of recursiveness and the attempt to clarify and formulate the notion of an effective process as it relates to the syntax of deductive systems. Section 4 concerns the decision problems which grew from the Hilbert program. Section 5 is devoted to the development of an informal' technique in the theory of computability often called ?argument by Church's thesis? (shrink)

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

This paper explores the relationship between Hume's Prinicple and Basic Law V, investigating the question whether we really do need to suppose that, already in Die Grundlagen, Frege intended that HP should be justified by its derivation from Law V.

-/- A schema (plural: schemata, or schemas), also known as a scheme (plural: schemes), is a linguistic template or pattern together with a rule for using it to specify a potentially infinite multitude of phrases, sentences, or arguments, which are called instances of the schema. Schemas are used in logic to specify rules of inference, in mathematics to describe theories with infinitely many axioms, and in semantics to give adequacy conditions for definitions of truth. -/- 1. What is a Schema? (...) 2. Uses of Schemas 3. The Ontological Status of Schemas 4. Schemas in the History of Logic Bibliography. (shrink)

This article discusses two coextensive concepts of logical consequence that are implicit in the two fundamental logical practices of establishing validity and invalidity for premise-conclusion arguments. The premises and conclusion of an argument have information content (they ?say? something), and they have subject matter (they are ?about? something). The asymmetry between establishing validity and establishing invalidity has long been noted: validity is established through an information-processing procedure exhibiting a step-by-step deduction of the conclusion from the premise-set. Invalidity is established by (...) exhibiting a countermodel satisfying the premises but not the conclusion. The process of establishing validity focuses on information content; the process of establishing invalidity focuses on subject matter. Corcoran's information-theoretic concept of logical consequence corresponds to the former. Tarski's model-theoretic concept of logical consequence formulated in his famous 1936 no-countermodels definition corresponds to the latter. Both are found to be indispensable for understanding the rationale of the deductive method and each complements the other. This study discusses the ontic question of the nature of logical consequence and the epistemic question of the human capabilities presupposed by practical applications of these two concepts as they make validity and invalidity accessible to human knowledge. (shrink)

Gödel’s first incompleteness theorem is sometimes said to refute mechanism about the mind. §1 contains a discussion of mechanism. We look into its origins, motivations and commitments, both in general and with regard to the human mind, and ask about the place of modern computers and modern cognitive science within the general mechanistic paradigm. In §2 we give a sharp formulation of a mechanistic thesis about the mind in terms of the mathematical notion of computability. We present the argument from (...) Gödel’s theorem against mechanism in terms of this formulation and raise two objections, one of which is known but is here given a more precise formulation, and the other is new and based on the discussion in §1. (shrink)

There is a well-known gap between metamathematical theorems and their philosophical interpretations. Take Tarski’s Theorem. According to its prevalent interpretation, the collection of all arithmetical truths is not arithmetically definable. However, the underlying metamathematical theorem merely establishes the arithmetical undefinability of a set of specific Gödel codes of certain artefactual entities, such as infix strings, which are true in the standard model. That is, as opposed to its philosophical reading, the metamathematical theorem is formulated (and proved) relative to a specific (...) choice of the Gödel numbering and the notation system. A similar observation applies to Gödel’s and Church’s theorems, which are commonly taken to impose severe limitations on what can be proved and computed using the resources of certain formalisms. The philosophical force of these limitative results heavily relies on the belief that these theorems do not depend on contingencies regarding the underlying formalisation choices. The main aim of this paper is to provide metamathematical facts which support this belief. While employing a fixed notation system, I showed in previous work (_Review of Symbolic Logic_, 2021, 14(1):51–84) how to abstract away from the choice of the Gödel numbering. In the present paper, I extend this work by establishing versions of Tarski’s, Gödel’s and Church’s theorems which are invariant regarding _both_ the notation system and the numbering. This paper thus provides a further step towards absolute versions of metamathematical results which do not rely on contingent formalisation choices. (shrink)

SEMANTIC ARITHMETIC: A PREFACE John Corcoran Abstract Number theory, or pure arithmetic, concerns the natural numbers themselves, not the notation used, and in particular not the numerals. String theory, or pure syntax, concems the numerals as strings of «uninterpreted» characters without regard to the numbe~s they may be used to denote. Number theory is purely arithmetic; string theory is purely syntactical... in so far as the universe of discourse alone is considered. Semantic arithmetic is a broad subject which begins when (...) numerals are mentioned (not just used) and mentioned as names of numbers (not just as syntactic objects). Semantic arithmetic leads to many fascinating and surprising algorithms and decision procedures; it reveals in a vivid way the experiential import of mathematical propositions and the predictive power of mathematical knowledge; it provides an interesting perspective for philosophical, historical, and pedagogical studies of the growth of scientific knowledge and of the role metalinguistic discourse in scientific thought. (shrink)

A major challenge in the philosophy of mathematics is to explain how mathematical language can pick out unique structures and acquire determinate content. In recent work, Button and Walsh have introduced a view they call ‘internalism’, according to which mathematical content is explained by internal categoricity results formulated and proven in second-order logic. In this paper, we critically examine the internalist response to the challenge and discuss the philosophical significance of internal categoricity results. Surprisingly, as we argue, while internalism arguably (...) explains how we pick out unique mathematical structures, this does not suffice to account for the determinacy of mathematical discourse. (shrink)

Corcoran, J. 2007. Syntactics, American Philosophy: an Encyclopedia. 2007. Eds. John Lachs and Robert Talisse. New York: Routledge. pp.745-6. -/- Syntactics, semantics, and pragmatics are the three levels of investigation into semiotics, or the comprehensive study of systems of communication, as described in 1938 by the American philosopher Charles Morris (1903-1979). Syntactics studies signs themselves and their interrelations in abstraction from their meanings and from their uses and users. Semantics studies signs in relation to their meanings, but still in abstraction (...) from their uses and users. Pragmatics studies signs as meaningful entities used in various ways by humans. Taking current written English as the system of communication under investigation, it is a matter of syntactics that the two four-character strings ‘tact’ and ‘tics’ both occur in the ten-character string ‘syntactics’. It is a matter of semantics that the ten-character string ‘syntactics’ has only one sense and, in that sense, it denotes a branch of semiotics. It is a matter of pragmatics that the ten-character string ‘syntactics’ was not used as an English word before 1937 and that it is sometimes confused with the much older six-character string ‘syntax’. Syntactics is the simplest and most abstract branch of semiotics. At the same time, it is the most basic. Pragmatics presupposes semantics and syntactics; semantics presupposes syntactics. The basic terms of syntactics include the following: ‘character’ as alphabetic letters, numeric digits, and punctuation marks; ‘string’ as sign composed of a concatenation of characters; ‘occur’ as ‘t’ and ‘c’ both occur twice in ‘syntactics’. However, perhaps the most basic terms of syntactics are ‘type’ and ‘token’ in the senses introduced by Charles Sanders Peirce (1839-1914), America’s greatest logician, who could be considered the grandfather of syntactics, if not the father. These are explained below. (shrink)

We investigate quantifier-free induction for Lisp-like lists constructed inductively from the empty list $$ nil $$ nil and the operation $${\textit{cons}}$$ cons, that adds an element to the front of a list. First we show that, for $$m \ge 1$$ m ≥ 1, quantifier-free $$m$$ m -step induction does not simulate quantifier-free $$(m + 1)$$ ( m + 1 ) -step induction. Secondly, we show that for all $$m \ge 1$$ m ≥ 1, quantifier-free $$m$$ m -step induction does not (...) prove the right cancellation property of the concatenation operation on lists defined by left-recursion. (shrink)

This book explores the interplay between logic and science, describing new trends, new issues and potential research developments.

We aim to show from a new perspective that Quine’s ontological relativity, based largely on his so-called “proxy-function argument”, falls short of being a rigorously coherent philosophical conception, as it exhibits significant formal defects. This new perspective enables exposing the shortcomings of Quine's position and suggests a possible reformulation of the original position. Moreover, we argue that his ontological relativity is inconsistent with the empirical data associated with some of our best physical theories, such as quantum mechanics. We refer to (...) fundamental concepts of philosophy and the foundations of mathematics in order to clarify our critique of Quine’s position concerning the relation between formalized theories and both what we can know about the real world and how we come to know it. (shrink)

Guided by questions of scope, this paper provides an overview of what is known about both the scope and, consequently, the limits of Gödel’s famous first incompleteness theorem.

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 common assumption among philosophers is that every language has at most denumerably many expressions. This assumption plays a prominent role in many philosophical arguments. Recently formal systems with indenumerably many elements have been developed. These systems are similar to the more familiar denumerable first-order languages. This similarity makes it appear that the assumption is false. We argue that the assumption is true.

I propose an account of the metaphysics of the expressions of a mathematical language which brings together the structuralist construal of a mathematical object as a place in a structure, the semantic notion of indexicality and Kit Fine's ontological theory of qua objects. By contrasting this indexical qua objects account with several other accounts of the metaphysics of mathematical expressions, I show that it does justice both to the abstractness that mathematical expressions have because they are mathematical objects and to (...) the element of concreteness that they have because they are also used as signs. In a concluding section, I comment on the pragmatic element that has entered ontology by way of the notion of indexicality and use it to give an answer to a question Stewart Shapiro has recently posed about the status of meta-mathematics in the structuralist philosophy of mathematics. (shrink)

A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. (...) Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ?0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on ? called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type that occurs in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. The second-order theory of any countably infinite Dedekind algebra is categorical, and there are countably infinite Dedekind algebras whose second-order theories are not finitely axiomatizable. It is shown that there is a condition on configuration signatures necessary and sufficient for the second-order theory of a Dedekind algebra to be finitely axiomatizable. It follows that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. (shrink)

Tarski's analysis of the concept of truth gives rise to a hierarchy of languages. Does this fragment the concept all the way to philosophical unacceptability? I argue it doesn't, drawing on a modification of Kaplan's theory of indexicals.

This brief, largely expository book—hereafter TT—blends history and philosophy of logic with contemporary mathematical logic. Page 3 says it “is about the relation between formal theories of truth...