Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules for (...) the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

The paper argues against an intuitive reading of the Stone-von Neumann theorem as a categoricity result, thereby pointing out that this theorem does not entail any model-theoretical difference between the theories that validate it and those that don't.

The entire development of modern logic is characterized by various forms of confrontation of what has come to be called proof theory with what has earned the label of model theory. For a long time the widely accepted view was that while model theory captures directly what logical formalisms are about, proof theory is merely our technical means of getting some incomplete grip on this; but in recent decades the situation has altered. Not only did proof theory expand into new (...) realms, generalizing the concept of proof in various directions; many philosophers also realized that meaning may be seen as primarily consisting in certain rules rather than in language-world links. However, the possibility of construing meaning as an inferential role is often seen as essentially compromised by the limits of prooftheoretical means. The aim of this paper is to sort out the cluster of problems besetting logical inferentialism by disentangling and clarifying one of them, namely determining the power of various inferential frameworks as measured by that of explicitly semantic ones. (shrink)

It is sometimes held that rules of inference determine the meaning of the logical constants: the meaning of, say, conjunction is fully determined by either its introduction or its elimination rules, or both; similarly for the other connectives. In a recent paper, Panu Raatikainen (2008) argues that this view - call it logical inferentialism - is undermined by some "very little known" considerations by Carnap (1943) to the effect that "in a definite sense, it is not true that the standard (...) rules of inference" themselves suffice to "determine the meanings of [the] logical constants" (p. 2). In a nutshell, Carnap showed that the rules allow for non-normal interpretations of negation and disjunction. Raatikainen concludes that "no ordinary formalization of logic ... is sufficient to `fully formalize' all the essential properties of the logical constants" (ibid.). We suggest that this is a mistake. Pace Raatikainen, intuitionists like Dummett and Prawitz need not worry about Carnap's problem. And although bilateral solutions for classical inferentialists - as proposed by Timothy Smiley and Ian Rumfitt - seem inadequate, it is not excluded that classical inferentialists may be in a position to address the problem too. (shrink)

Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which may be helpful in its philosophical assessment. I suggest a vantage point from which to see the way in which classical proof-theories do, at least to a considerable extent, encode the meanings of the connectives (not by determining a range of admissible valuations, but in their own way), and I demonstrate (...) a kind of converse to Carnap’s result. (shrink)

Quantifier variance faces a number of difficulties. In this paper we first formulate the view as holding that the meanings of the quantifiers may vary, and that languages using different quantifiers may be charitably translated into each other. We then object to the view on the basis of four claims: (i) quantifiers cannot vary their meaning extensionally by changing the domain of quantification; (ii) quantifiers cannot vary their meaning intensionally without collapsing into logical pluralism; (iii) quantifier variance is not an (...) ontological doctrine; (iv) quantifier variance is not compatible with charitable translation and as such is internally inconsistent. In light of these troubles, we recommend the dissolution of quantifier variance and suggest that the view be laid to rest. (shrink)

The categoricity problem for a system of logic reveals an asymmetry between the model-theoretic and the proof-theoretic resources of that logic. In particular, it reveals prima facie that the proof-theoretic instruments are insufficient for matching the envisaged model-theory, when the latter is already available. Among the proposed solutions for solving this problem, some make use of new proof-theoretic instruments, some others introduce new model-theoretic constrains on the proof-systems, while others try to use instruments from both sides. On the proof-theoretical side, (...) two main approaches for solving the categoricity problem for propositional classical logic consist in the enforcement of the formal systems of this logic by introducing rules of inference of a new kind. A multiple-conclusions logic allows rules of inference with more than one conclusion, while a bilateralist system contains rules of inference formulated in terms of assertion and rejection. Both these approaches reveal interesting formal features of logical reasoning. This paper analyses some of the advantages and limitations of these two approaches as solutions for a full formalization of logic, i.e., for a categorical formalization. (shrink)

This book concerns the metasemantics of quantum mechanics (QM). Roughly, it pursues an investigation at an intersection of the philosophy of physics and the philosophy of semantics, and it offers a critical analysis of rival explanations of the semantic facts of standard QM. Two problems for such explanations are discussed: categoricity and permanence of rules. New results include 1) a reconstruction of Einstein's incompleteness argument, which concludes that a local, separable, and categorical QM cannot exist, 2) a reinterpretation of Bohr's (...) principle of correspondence, grounded in the principle of permanence, 3) a meaning-variance argument for quantum logic, which follows a line of critical reflections initiated by Weyl, and 4) an argument for semantic indeterminacy leveled against inferentialism about QM, inspired by Carnap's work in the philosophy of classical logic. (shrink)

A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline). Consider the following argument: 1. If we charge high fees for university, only the rich will enroll. We charge high fees for university. Therefore, only the rich (...) will enroll. There are many different things one can say about this argument, but many agree that if we do not equivocate (if the terms mean the same thing in the premises and the conclusion) then the argument is valid, that is, the conclusion follows deductively from the premises. This does not mean that the conclusion is true. Perhaps the premises are not true. However, if the premises are true, then the conclusion is also true, as a matter of logic. This entry is about the relation between premises and conclusions in valid arguments. (shrink)

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)

What is the relation of logic to thinking? My dissertation offers a new argument for the claim that logic is constitutive of thinking in the following sense: representational activity counts as thinking only if it manifests sensitivity to logical rules. In short, thinking has to be minimally logical. An account of thinking has to allow for our freedom to question or revise our commitments – even seemingly obvious conceptual connections – without loss of understanding. This freedom, I argue, requires that (...) thinkers have general abilities to respond to support and tension among their thoughts. And these abilities are constituted by following logical rules. So thinkers have to follow logical rules. But there isn’t just one correct logic for thinking. I show that my view is consistent with logical pluralism: there are a range of correct logics, any one of which a thinker might follow. A logic for thinking does, however, have to contain certain minimal principles: Modus Ponens and Non-Contradiction, and perhaps others. We follow logical rules by exercising logical capacities, which display a distinctive first-person/third-person asymmetry: a subject can find the instances of a rule compelling without seeing them as instances of a rule. As a result, there are two limits on illogical thinking. First, thinkers have to tend to find instances of logical rules compelling. Second, thinkers can’t think in obviously illogical ways. So thinking has to be logical – but not perfectly so. When we try to think, but fail, we produce nonsense. But our failures to think are often subjectively indistinguishable from thinking. To explain how this occurs, I offer an account of nonsense. To be under the illusion that some nonsense makes sense is to enter a pretence that the nonsense is meaningful. Our use of nonsense within the pretence relies on the role of logical form in understanding. Finally, while the normativity of logic doesn’t fall directly out of logical constitutivism, it’s possible to build an attractive account of logical normativity which has logical constitutivism as an integral part. I argue that thinking is necessary for human flourishing, and that this is the source of logical normativity. (shrink)

This paper is a conceptual study in the philosophy of logic. The question considered is 'How may formulae of the propositional calculus be brought into a representational relation to the world?'. Four approaches are distinguished: (1) the denotational approach, (2) the abbreviational approach, (3) the truth-conditional approach, and (4) the modelling approach. (2) and (3) are very familiar, so I do not discuss them. (1), which is now largely obsolete, led to some interesting twists and turns in early analytic philosophy (...) which will come as news to many contemporary readers, so I discuss it in some detail. The modelling approach is, to the best of my knowledge, newly introduced here. I am not presenting it as a rival to the other approaches, but as a philosophically interesting possibility. (shrink)

Carnap in the 1930s discovered that there were non-normal interpretations of classical logic - ones for which negation and conjunction are not truth-functional so that a statement and its negation could have the same truth value, and a disjunction of two false sentences could be true. Church ar-gued that this did not call for a revision of classical logic. More recent writers seem to disa-gree. We provide a definition of "non-normal interpretation" and argue that Church was right, and in fact, (...) the existence of non-normal interpretations tells us something important about the condi-tions of extensionality of the classical logical operators. (shrink)

This paper attempts to motivate the view that instead of rejecting modus ponens as invalid in certain situations, one could preserve its validity by associating such situations with non-normal interpretations of logical connectives.