Logic is usually thought to concern itself only with features that sentences and arguments possess in virtue of their logical structures or forms. The logical form of a sentence or argument is determined by its syntactic or semantic structure and by the placement of certain expressions called “logical constants.”[1] Thus, for example, the sentences Every boy loves some girl. and Some boy loves every girl. are thought to differ in logical form, even though they share a common syntactic and semantic (...) structure, because they differ in the placement of the logical constants “every” and “some”. By contrast, the sentences Every girl loves some boy. and Every boy loves some girl. are thought to have the same logical form, because “girl” and “boy” are not logical constants. Thus, in order to settle questions about logical form, and ultimately about which arguments are logically valid and which sentences logically true, we must distinguish the “logical constants” of a language from its nonlogical expressions. (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)

Kit Fine has reawakened a puzzle about variables with a long history in analytic philosophy, labeling it “the antinomy of the variable”. Fine suggests that the antinomy demands a reconceptualization of the role of variables in mathematics, natural language semantics, and first-order logic. The difficulty arises because: (i) the variables ‘x’ and ‘y’ cannot be synonymous, since they make different contributions when they jointly occur within a sentence, but (ii) there is a strong temptation to say that distinct variables ‘x’ (...) and ‘y’ are synonymous, since sentences differing by the total, proper substitution of ‘x’ for ‘y’ always agree in meaning. We offer a precise interpretation of the challenge posed by (i) and (ii). We then develop some neglected passages of Tarski to show that his semantics for variables has the resources to resolve the antinomy without abandoning standard compositional semantics. (shrink)

In Writing the Book of the World, Ted Sider argues that David Lewis’s distinction between those predicates which are ‘perfectly natural’ and those which are not can be extended so that it applies to words of all semantic types. Just as there are perfectly natural predicates, there may be perfectly natural connectives, operators, singular terms and so on. According to Sider, one of our goals as metaphysicians should be to identify the perfectly natural words. Sider claims that there is a (...) perfectly natural first-order quantifier. I argue that this claim is not justified. Quine has shown that we can dispense with first-order quantifiers, by using a family of ‘predicate functors’ instead. I argue that we have no reason to think that it is the first-order quantifiers, rather than Quine’s predicate functors, which are perfectly natural. The discussion of quantification is used to provide some motivation for a general scepticism about Sider’s project. Shamik Dasgupta’s ‘generalism’ and Jason Turner’s critique of ‘ontological nihilism’ are also discussed. (shrink)

This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...) I argue that Bold Physical CT is not relevant to the epistemological concerns that motivate CT and hence not suitable as a physical analog of Mathematical CT. The correct physical analog of Mathematical CT is Modest Physical CT. I propose to explicate the notion of physical computability in terms of a usability constraint, according to which for a process to count as relevant to Physical CT, it must be usable by a finite observer to obtain the desired values of a function. Finally, I suggest that proposed counterexamples to Physical CT are still far from falsifying it because they have not been shown to satisfy the usability constraint. (shrink)

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

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)

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...) -definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity. (shrink)

Propositionalism is the view that intentional attitudes, such as belief, are relations to propositions. Propositionalists argue that propositionalism follows from the intuitive validity of certain kinds of inferences involving attitude reports. Jubien (2001) argues powerfully against propositions and sketches some interesting positive proposals, based on Russell’s multiple relation theory of judgment, about how to accommodate “propositional phenomena” without appeal to propositions. This paper argues that none of Jubien’s proposals succeeds in accommodating an important range of propositional phenomena, such as the (...) aforementioned validity of attitude-report inferences. It then shows that the notion of a predication act-type, which remains importantly Russellian in spirit, is sufficient to explain the range of propositional phenomena in question, in particular the validity of attitude-report inferences. The paper concludes with a discussion of whether predication act-types are really just propositions by another name. (shrink)

§0. Alonzo Church's contributions to philosophy and to that most philosophical part of logic, intensional logic, are impressive indeed. He wrote relatively few papers actually devoted to specifically philosophical issues, as distinguished from related technical work in logic. Many of his contributions appear in reviews for The Journal of Symbolic Logic, and it can hardly be maintained that one finds there a “philosophical system”. But there occur a clearly articulated and powerful methodology, terse arguments, often of “crushing cogency”, and philosophical (...) observations of the first importance.Many of the less formal philosophical contributions center around questions concerning meaning, but there are important clarifications and insights into matters of the epistemology and ontology of the sciences, especially the formal sciences.1.1. The logistic method. Church's writings on philosophical matters exhibit an unwavering commitment to what he called the “logistic method”. The term did not catch on and now one would just speak of “formalization”. The use of these ideas is now so common and familiar among logicians and logically-oriented philosophers that they are simply taken for granted. But they deserve to be celebrated and re-emphasized, for there are philosophers who seriously underestimate and even consciously reject these techniques. (shrink)

This paper aims to outline an analysis and interpretation of the process that led to First-Order Logic and its consolidation as a core system of modern logic. We begin with an historical overview of landmarks along the road to modern logic, and proceed to a philosophical discussion casting doubt on the possibility of a purely rational justification of the actual delimitation of First-Order-Logic. On this basis, we advance the thesis that a certain historical tradition was essential to the emergence of (...) modern logic; this traditional context is analyzed as consisting in some guiding principles and, particularly, a set of exemplares (i.e., paradigmatic instances). Then, we proceed to interpret the historical course of development reviewed in section 1, which can broadly be described as a two-phased movement of expansion and then restriction of the scope of logical theory. We shall try to pinpoint ambivalencies in the process, and the main motives for subsequent changes. Among the latter, one may emphasize the spirit of modern axiomatics, the situation of foundational insecurity in the 1920s, the resulting desire to find systems well-behaved from a proof-theoretical point of view, and the metatheoretical results of the 1930s. Not surprisingly, the mathematical and, more specifically, the foundational context in which Firs-Order-Logic matured will be seen to have played a primary role in its shaping. (shrink)

We all learn about the mistake of treating ‘nothing’ as if it were a term standing for something; but is it a mistake to treat it as an empty term, denoting nothing? We argue not, and we introduce ‘zilch’, defined as ‘the non-self-identical thing’, as a term which is empty as a matter of logical necessity. We contrast its behaviour with that of the quantifier ‘nothing’, and illustrate its uses. We use the same idea to vindicate Locke’s, Descartes’ and Hume’s (...) handling of ‘nothing’, and we show how Heidegger’s ‘das Nichts nichtet’ comes out as logically true. (shrink)

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...) Lemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effectivization by Borel, Lusin, Addison, and others. (shrink)

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus seen as the logic of subsets of (...) a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (shrink)

Dramatic changes or revolutions in a field of science are often made by outsiders or 'trespassers,' who are not limited by the established, 'expert' approaches. Each essay in this diverse collection shows the fruits of intellectual trespassing and poaching among fields such as economics, Kantian ethics, Platonic philosophy, category theory, double-entry accounting, arbitrage, algebraic logic, series-parallel duality, and financial arithmetic.

Tarski's 1936 paper, “On the concept of logical consequence”, is a rather philosophical, non-technical paper that leaves room for conflicting interpretations. My purpose is to review some important issues that explicitly or implicitly constitute its themes. My discussion contains four sections: terminological and conceptual preliminaries, Tarski's definition of the concept of logical consequence, Tarski's discussion of omega-incomplete theories, and concluding remarks concerning the kind of conception that Tarski's definition was intended to explicate. The third section involves subsidiary issues, such as (...) Tarski's discussion concerning the distinction between material and formal consequence and the important question ofthe criterion for distinguishing between logical and non-logical terms.§1. Preliminaries. In this paper an argument is a two-part system composed of a set of propositions P and a single proposition c. The expression ‘c is a [logical] consequence of P’ is used with the same meaning as the expression ‘c is [logically] implied by P’. The expressions ‘is a logical consequence of’ and the converse ‘implies’ are relational. Often, I shall be talking in the same sense of validity of an argument. Validity is a property of arguments; an argument with premise-set P and conclusion c is valid if and only if P implies c; i.e., c is a logical consequence of P. Notice that this notion of argument is strictly ontic; it does not involve any agent that thinks, determines or establishes that a given proposition is or is not a consequence of a given set of propositions. (shrink)

In this work, we focus on a very specific case study: assuming that quantum theories deal with “particles” of some kind, what kind of entity can such particles be? One possible answer, the one we shall examine here, is that they are not the usual kind of object found in daily life: individuals. Rather, we follow a suggestion by Erwin Schrödinger, according to which quantum mechanics poses a revolutionary kind of entity: non-individuals. While physics, as a scientific field, is not (...) concerned with whether entities posited by a specific physical theory are individuals or not, answering this question is part of the quest for a better understanding of physical reality. Here lies, in large measure, the relevance of ontology. (shrink)

Does the epistemology of disagreement have significant consequences for theories of conceptual understanding? I argue that it does. I argue that the epistemology of disagreement manifests the existence of a special kind of concept, perspectival modes of metarepresentation, a kind of concept instances of which figure in the thinking about thoughts that occurs in deep disagreement. These perspectival modes of metarepresentation are de re modes of presentation of thoughts themselves – hence de re modes of metarepresentation – in which one (...) and the same thought is presented to higher‐order thinking about thoughts in different ways. These modes or ways are de re and perspectival because they are individuated by facts about whether the thought being thought about is the grasped or understood propositional object of one's own or another's thinking. I outline a broadly Fregean framework for theorizing conceptual understanding and draw out three significant consequences of the existence of perspectival modes of metarepresentation for theories of conceptual understanding: they (1) constitute a new philosophical motivation for a restricted fragment of what Terence Parsons calls a “libertine” hierarchy of Fregean sense; (2) provide, against David Chalmers, examples of a priori equivalences that are nevertheless cognitively significant; and (3) constitute a novel and pervasive example of Kripkean ‘Paderewski’‐type designators. (shrink)

Abstract. On the Direct Reference thesis, proper names are what I call ‘genuine terms’, terms whose sole semantic contributions to the propositions expressed by their use are the terms’ semantic referents. But unless qualified, this thesis implies the false consequence that sentences containing names that fail to refer can never express true or false propositions. (Consider ‘The ancient Greeks worshipped Zeus’, for instance.) I suggest that while names are typically and fundamentally used as genuine terms, there is a small class (...) of names, which I call ‘descriptive names’, whose reference is fixed by commonly associated definite descriptions, and I also suggest that there is an idiom of natural language on which such names can be used as abbreviated definite descriptions in a limited set of sentential contexts, including (1) positive and negative existentials, (2) cognitive ascriptions, and (3) uses of names to talk about myth. Uses of empty descriptive names in such contexts can then be either true or false. Relying on Gregory Currie’s theory of truth in fiction, I also propose an idiom on which fictional names can be used as short for a certain type of description in talk about fiction. Along the way, I provide arguments that names are used as short for descriptions in substantive existential statements as well as in both metamythic and metafictive contexts. I also discuss and criticize alternative views of these matters, including the views of David Braun, Saul Kripke, Peter van Inwagen, and others. (shrink)

Convinced that the classically undecidable problems of mathematics possess determinate truth values, Gödel issued a programmatic call to search for new axioms for their solution. The platonism underlying his belief in the determinateness of those questions in combination with his conception of intuition as a kind of perception have struck many of his readers as highly problematic. Following Gödel's own suggestion, this article explores ideas from phenomenology to specify a meaning for his mathematical realism that allows for a defensible epistemology.

The purpose of this article is to delimit what can and cannot be claimed on behalf of second-order logic. The starting point is some of the discussions surrounding my Foundations without Foundationalism: A Case for Secondorder Logic.

constructive empiricism asserts that it is not for science to reach a verdict on whether a theory is true or false, if the theory is about unobservable entities; science's only interest here, says Van Fraassen, is to discover whether the theory is ‘empirically adequate’. However, if a theory is soley about observables, empirical adequacy and truth are said to ‘coincide’, here discovering the theory's truth value is an appropriate scientific goal. Constructive empiricism thus rests an epistemological thesis on a semantical (...) distinction. This paper critically examines the notion of aboutness and its epistemological significance. * I am grateful to members of my philosophy of science seminar during Spring, 1983 for useful discussion and to the two anonymous referees of this journal for providing helpful suggestions. I also thank the University of Wisconsin, Madison Graduate School for support in the form of a Romnes Faculty Fellowship. (shrink)

According to some scholars, such as Rodych and Steiner, Wittgenstein objects to Gödel’s undecidability proof of his formula $$G$$, arguing that given a proof of $$G$$, one could relinquish the meta-mathematical interpretation of $$G$$ instead of relinquishing the assumption that Principia Mathematica is correct. Most scholars agree that such an objection, be it Wittgenstein’s or not, rests on an inadequate understanding of Gödel’s proof. In this paper, I argue that there is a possible reading of such an objection that is, (...) in fact, reasonable and related to Gödel’s proof. (shrink)

A first-order formulation of Leśniewski's ontology is formulated and shown to be interpretable within a free first-order logic of identity extended to include nominal quantification over proper and common-name concepts. The latter theory is then shown to be interpretable in monadic second-order predicate logic, which shows that the first-order part of Leśniewski's ontology is decidable.

In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...) in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (shrink)

This is an examination, a commentary, of links between some philosophical views ascribed to Gödel and general proof theory. In these views deduction is of central concern not only in predicate logic, but in set theory too, understood from an infinitistic ideal perspective. It is inquired whether this centrality of deduction could also be kept in the intensional logic of concepts whose building Gödel seems to have taken as the main task of logic for the future.

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

Relevantism, as a matter of definition, rejects classical logic as incorrect and adopts instead a relevant logic as encapsulating correct inference. It rejects classical logic on the grounds that the rule of Material Detachment, from A and not A or B to infer B,, sometimes leads from truth to falsity. Relevantism — although promoted by some relevant logicians, and an integral part of ultralogic — has recently encountered heavy, but interesting, criticism from relevance logicians themselves.

Firstly I characterize Simple Partial Logic (SPL) as the generalization and extension of a certain two-valued logic. Based on the characterization I present two definitions of validity in SPL. Finally I show that given my characterization these two definitions are more appropriate than other definitions that have been prevalent, since both have some desirable semantic properties that the others lack.

_ Source: _Volume 95, Issue 3, pp 368 - 413 Frege famously maintained that concepts are not objects. A key argument of Frege’s for this view is, in outline, as follows: if we are to account for the unity of thought, concepts must be deemed _unsaturated_; since objects are, by contrast, saturated entities, concepts cannot be objects. The author investigates what can be made of this argument and, in particular, of the unsaturated/saturated distinction it invokes. Systematically exploring a range of (...) reconstructions suggested by Frege’s writings, and drawing on contemporary work, the author illustrates that no plausible reconstruction is forthcoming. In essence, it is altogether unclear how to simultaneously substantiate, on the one hand, the claim that unsaturated entities must be recognized in order to account for unity and, on the other, the claim that unsaturatedness is incompatible with objecthood. (shrink)

This is a draft for a revised edition of Mark Sharlow's book "From Brain to Cosmos." It includes most of the material from the first edition, two shorter pieces pertaining to the book, and a detailed new introduction.

In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...) systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans. Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics. (shrink)

First-order logic haslimitedexistential import: the universalized conditional ∀x[S(x) → P(x)] implies its corresponding existentialized conjunction ∃x[S(x) & P(x)] insome but not allcases. We prove theExistential-Import Equivalence:∀x[S(x) → P(x)] implies ∃x[S(x) & P(x)] iff ∃xS(x) is logically true.The antecedent S(x) of the universalized conditional alone determines whether the universalized conditionalhas existential import: implies its corresponding existentialized conjunction.Apredicateis a formula having onlyxfree. Anexistential-importpredicate Q(x) is one whose existentialization, ∃xQ(x), is logically true; otherwise, Q(x) isexistential-import-freeor simplyimport-free. Existential-import predicates are also said to beimport-carrying.How (...) widespread is existential import? How widespread are import-carrying predicates in themselves or in comparison to import-free predicates? To answer, let L be any first-order language with any interpretation INT in any [sc. nonempty] universe U. A subset S of U isdefinable inLunderINT iff for some predicate Q(x) in L, S is the truth-set of Q(x) under INT. S isimport-carrying definableiff S is the truth-set of an import-carrying predicate. S isimport-free definableiff S is the truth-set of an import-free predicate.Existential-Importance Theorem: Let L, INT, and U be arbitrary. Every nonempty definable subset of U isbothimport-carrying definableandimport-free definable.Import-carrying predicates are quite abundant, and no less so than import-free predicates. Existential-import implications hold as widely as they fail.A particular conclusion cannot be validly drawn from a universal premise, or from any number of universal premises.—Lewis-Langford, 1932, p. 62. (shrink)

This paper can be read as an attempt at providing philosophical foundations to linear logic. The only plausible form of philosophical antirealism deals with practical feasibility rather than with effectivity in principle. The very notion of recognizability is ambiguous, audit has to be considered from a stricter perspective than currently done. The intuitionistic assertability conditions are to be reinforced. This change requires a move towards a frame in which the circumstances of the application of a logical rule can be specified. (...) Gentzen's sequential calculi provide such a frame, when some structural rules have been removed or limited. (shrink)

The present discussion takes up an issue raised in Section 5 of Ross Brady and Penelope Rush’s paper ‘Four Basic Logical Issues’ concerning the (claimed) triviality – in the sense of automatic availability – of soundness and completeness results for a logic in a metalanguage employing at least as much logical vocabulary as the object logic, where the metalogical behaviour of the common logical vocabulary is as in the object logic. We shall see – in Propositions 4.5–4.7 – that this (...) triviality claim faces difficulties in the face of Halldén incompleteness, for essentially the same reasons that Halldén thought this phenomenon raised seman- tic difficulties for the modal logics of C. I. Lewis exhibiting it. To counter any inclination to dismiss the phenomenon as providing at best a marginal range of counterexamples to the triviality claim, a Postscript assembles some reminders of the extent of – and the varied considerations favouring – Halldén incompleteness. (shrink)

“The confusion of a logical with a real predicate,” according to the Critique of Pure Reason, “is almost beyond correction”. Kant did not assert that existence is no predicate, but that it is only a “logical” one, and not a “real” one. Much the same thing has been said about identity, although Kant himself thought it is real and not logical. We have long lacked a rigorous criterion to distinguish real from logical predicates, and hence have not been able to (...) say why the difference matters. This paper has two objects. First it provides a demarcation between real and logical predicates that confirms Kant's dictum that existence is only “logical.” Secondly it states the theory of a “logical” relation of identity. Perhaps this is not the only identity relation. I show only that once it has been precisely defined in the right setting, there are definite answers to a number of disputed questions about identity. Maybe there are other concepts of identity for which different answers are to be given, but I shall not discuss that disagreeable prospect here. A third application concerns the ontological argument. (shrink)