Logical Connectives, Misc

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (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)

In this paper, we approach the problem of classical recapture for LP and K3 by using normality operators. These generalize the consistency and determinedness operators from Logics of Formal Inconsistency and Underterminedness, by expressing, in any many-valued logic, that a given formula has a classical truth value (0 or 1). In particular, in the rst part of the paper we introduce the logics LPe and Ke3 , which extends LP and K3 with normality operators, and we establish a classical recapture (...) result based on the two logics. In the second part of the paper, we compare the approach in terms of normality operators with an established approach to classical recapture, namely minimal inconsistency. Finally, we discuss technical issues connecting LPe and Ke3 to the tradition of Logics of Formal Inconsistency and Underterminedness. (shrink)

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the same conclusion would have to be identified. In this paper it will be shown that the question, which reductions we accept in our system, is not only important if we see them as generating a theory of proof identity but is also (...) decisive for the more general question whether a proof has meaningful content. There are certain reductions which would not only force us to identify proofs of different arbitrary formulas but which would render derivations in a system allowing them meaningless. To exclude such cases, a minimal criterion is proposed which reductions have to fulfill to be acceptable. (shrink)

The use of the symbol ∨for disjunction in formal logic is ubiquitous. Where did it come from? The paper details the evolution of the symbol ∨ in its historical and logical context. Some sources say that disjunction in its use as connecting propositions or formulas was introduced by Peano; others suggest that it originated as an abbreviation of the Latin word for “or,” vel. We show that the origin of the symbol ∨ for disjunction can be traced to Whitehead and (...) Russell’s pre-Principia work in formal logic. Because of Principia’s influence, its notation was widely adopted by philosophers working in logic (the logical empiricists in the 1920s and 1930s, especially Carnap and early Quine). Hilbert’s adoption of ∨ in his Grundzüge der theoretischen Logik guaranteed its widespread use by mathematical logicians. The origins of other logical symbols are also discussed. (shrink)

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

We argue that, if taken seriously, Kripke's view that a language for science can dispense with a negation operator is to be rejected. Part of the argument is a proof that positive logic, i.e., classical propositional logic without negation, is not categorical.

I argue against the skeptical epistemological view exemplified by the Groarkes that “all theories of informal argument must face the regress problem.” It is true that in our theoretical representations of reasoning, infinite regresses of self-justification regularly and inadvertently arise with respect to each of the RSA criteria for argument cogency (the premises are to be relevant, sufficient, and acceptable). But they arise needlessly, by confusing an RSA criterion with argument content, usually premise material.

Prior’s Tonk is a famously horrible connective. It is defined by its inference rules. My aim in this article is to compare Tonk with some hitherto unnoticed nasty connectives, which are defined in semantic terms. I first use many-valued truth-tables for classical sentential logic to define a nasty connective, Knot. I then argue that we should refuse to add Knot to our language. And I show that this reverses the standard dialectic surrounding Tonk, and yields a novel solution to the (...) problem of many-valued truth-tables for classical sentential logic. I close by outlining the technicalities surrounding nasty connectives on many-valued truth-tables. (shrink)

This paper consider Prior's connective Tonk from a particular bilateralist perspective. I show that there is a natural perspective from which we can see Tonk and its ilk as perfectly well-defined pieces of vocabulary; there is no need for restrictions to bar things like Tonk.

This self-contained lecture examines uses and misuses of the adverb conversely with special attention to logic and logic-related fields. Sometimes adding conversely after a conjunction such as and signals redundantly that a converse of what preceded will follow. -/- (1) Tarski read Church and, conversely, Church read Tarski. -/- In such cases, conversely serves as an extrapropositional constituent of the sentence in which it occurs: deleting conversely doesn’t change the proposition expressed. Nevertheless it does introduce new implicatures: a speaker would (...) implicate belief that the second sentence expresses a converse of what the first expresses. Perhaps because such usage is familiar, the word conversely can be used as “sentential pronoun”—or prosentence—representing a sentence expressing a converse of what the preceding sentence expresses. -/- (2) Tarski read Church and conversely. -/- This would be understood as expressing the proposition expressed by (1). Prosentential usage introduces ambiguity when the initial proposition has more than one converse. Confusion can occur if the initial proposition has non-equivalent converses. -/- Every proposition that is the negation of a false proposition is true and conversely. -/- One sense implies that every proposition that is the negation of a true proposition is false, which is true of course. But another sense, probably more likely, implies that every proposition that is true is the negation of a false proposition, which is false: the proposition that one precedes two is not a negation and thus is not the negation of a false proposition. The above also applies to synonyms of conversely such as vice versa. Although prosentence has no synonym, extrapropositional constituents are sometimes called redundant rhetoric, filler, or expletive. Authors discussed include Aristotle, Boole, De Morgan, Peirce, Frege, Russell, Tarski, and Church. END OF PUBLISHED ABSTRACT -/- See also: Corcoran, John. 2015. Converses, inner and outer. 2015. Cambridge Dictionary of Philosophy, third edition, Robert Audi (editor). Cambridge: Cambridge UP. https://www.academia.edu/10396347/Corcoran_s_27_entries_in_the_1999_second_edition_Audi_s_Cambridge_ Dictionary_of_Philosophy . (shrink)

No existing conditional semantics captures the dual role of 'if' in embedded interrogatives — 'X wonders if p' — and conditionals. This paper presses the importance and extent of this challenge, linking it to cross-linguistic patterns and other phenomena involving conditionals. Among these other phenomena are conditionals with multiple 'if'-clauses in the antecedent — 'if p and if q, then r' — and relevance conditionals — 'if you are hungry, there is food in the cupboard'. Both phenomena are shown to (...) be problematic for existing analyses. Surprisingly, the decomposition of conditionals needed to capture the link with interrogatives provides a new analysis that captures all three phenomena. The model-theoretic semantics offered here relies on a dynamic conception of meaning and compositionality, a feature discussed throughout. (shrink)

In 1926, Ernst Mally, an Austrian logician, has introduced a system of deontic logic in which he has proposed three fundamental distinctions which proved to be important in the context of the further development of the logic of norms. It is argued that in his philosophical considerations Mally has introduced a number of important distinctions concerning the very concept of norm, but by getting them confused in introducing the subsequent formalisms he failed to formally preserve them. In some of his (...) philosophically made distinctions Mally apparently foresaw contemporary trends in logic of norms. To some extent this particular feature of Mally’s system open wide opportunities to reconstruct –– with the corresponding renovations — his illformed Deontik into many nowadays known systems of logic of norms and thus provides a fertile ground for this kind of research. (shrink)

The aim of this paper is to clarify the truth-functional interpretation of the logical connective of the material implication. The importance of such clarification lies in the fact that it allows avoiding the supposed paradoxes introduced by C. I. Lewis (1918). I argue that an adequate understanding of the history and purposes of logic is enough to dissolve them away. The defense is based on an exposition of propositional compositionalism. To compare, I also present Stalnaker’s (1968) alternative that seeks to (...) explain the implicit concept of conditionality of conditionals assertions. In order to reinforce my aim I expound the twelve different meanings of ‘implication’ stated by Corcoran (1993) in order to hold that a proper understanding of these meanings allows us to avoid ambiguities and confusions. Finally, I expect to show that despite the possible alternatives, compositionalism is still the best explanation for the truth-functionality account of logical connectives. (shrink)

I show that the model-theoretic meaning that can be read off the natural deduction rules for disjunction fails to have certain desirable properties. I use this result to argue against a modest form of inferentialism which uses natural deduction rules to fix model-theoretic truth-conditions for logical connectives.

The theory of imperatives is philosophically relevant since in building it — some of the long standing problems need to be addressed, and presumably some new ones are waiting to be discovered. The relevance of the theory of imperatives for philosophical research is remarkable, but usually recognized only within the field of practical philosophy. Nevertheless, the emphasis can be put on problems of theoretical philosophy. Proper understanding of imperatives is likely to raise doubts about some of our deeply entrenched and (...) tacit presumptions. In philosophy of language it is the presumption that declaratives provide the paradigm for sentence form; in philosophy of science it is the belief that theory construction is independent from the language practice, in logic it is the conviction that logical meaning relations are constituted out of logical terminology, in ontology it is the view that language use is free from ontological commitments. The list is not exhaustive; it includes only those presumptions that this paper concerns. (shrink)

This article has one aim, to reject the claim that negation is semantically ambiguous. The first section presents the putative incompatibility between truth-value gaps and the truth-schema; the second section presents the motivation for the ambiguity thesis; the third section summarizes arguments against the claim that natural language negation is semantically ambiguous; and the fourth section indicates the problems of an introduction of two distinct negation operators in natural language.

In this essay I give a complete join semi-lattice of possible display-equivalence schemes for Display Logic, using the standard connectives, and leaving fixed only the schemes governing the star. In addition to proving the completeness of this list, I offer a discussion of the basic properties of these schemes.

I argue that David Lewis is too quick to deny the presentist the right to employ span operators. There is no reason why the presentist could not help herself to both primitive tensed slice operators and primitive span operators. She would then have another device available to eliminate ambiguities and explain why sentences with embedded contradictions may nevertheless be true.

Motivated by H. Curry’s well-known objection and by a proposal of L. Henkin, this article introduces the positive tableaux, a form of tableau calculus without refutation based upon the idea of implicational triviality. The completeness of the method is proven, which establishes a new decision procedure for the (classical) positive propositional logic. We also introduce the concept of paratriviality in order to contribute to the question of paradoxes and limitations imposed by the behavior of classical implication.

Despite the wide acceptance of standard modal logic, there has always been a temptation to think that ordinary modal discourse may be correctly analyzed and adequately represented in terms of predicates rather than in terms of operators. The aim of the formal model outlined in this paper is to capture what I take to be the only plausible sense in which ‘possible’ and ‘necessary’ can be treated as predicates. The model is built by enriching the language of standard modal logic (...) with a quantificational apparatus that is “substitutional” rather than “objectual”, and by obtaining from the language so enriched another language in which constants for such predicates apply to singular terms that stand for propositions. (shrink)

Italian translation of "On Logical Relativity" (2002), by Luca Morena.

One logic or many? I say—many. Or rather, I say there is one logic for each way of specifying the class of all possible circumstances, or models, i.e., all ways of interpreting a given language. But because there is no unique way of doing this, I say there is no unique logic except in a relative sense. Indeed, given any two competing logical theories T1 and T2 (in the same language) one could always consider their common core, T, and settle (...) on that theory. So, given any language L, one could settle on the minimal logic T0 corresponding to the common core shared by all competitors. That would be a way of resisting relativism, as long as one is willing to redraw the bounds of logic accordingly. However, such a minimal theory T0 may be empty if the syntax of L contains no special ingredients the interpretation of which is independent of the specification of the relevant L-models. And generally—I argue—this is indeed the case. (shrink)

This work gives an extended presentation of the treatment of variable-binding operators adumbrated in [3:1993d]. Illustrative examples include elementary languages with quantifiers and lambda-equipped categorial languages. Some remarks are also offered to illustrate the philosophical import of the resulting picture. Particularly, a certain conception of logic emerges from the account: the view that logics are true theories in the model-theoretic sense, i.e. the result of selecting a certain class of models as the only “admissible” interpretation structures (for a given language).

Proves two simple identities relating the biconditional and exclusive disjunction. -/- The PDF has been made available gratis by the publisher.

This thesis explores the syntax and semantics of coordinate structures on the basis of three-dimensional syntactic structures. In particular it gives an analysis of sentences of the sort 'a man came and a woman left who knew each other well' on the basis of implicit coordination of NPs, made available within three-dimensionional syntactic structures..

This paper defines the form of prior knowledge that is required for sound inferences by analogy and single-instance generalizations, in both logical and probabilistic reasoning. In the logical case, the first order determination rule defined in Davies (1985) is shown to solve both the justification and non-redundancy problems for analogical inference. The statistical analogue of determination that is put forward is termed 'uniformity'. Based on the semantics of determination and uniformity, a third notion of "relevance" is defined, both logically and (...) probabilistically. The statistical relevance of one function in determining another is put forward as a way of defining the value of information: The statistical relevance of a function F to a function G is the absolute value of the change in one's information about the value of G afforded by specifying the value of F. This theory provides normative justifications for conclusions projected by analogy from one case to another, and for generalization from an instance to a rule. The soundness of such conclusions, in either the logical or the probabilistic case, can be identified with the extent to which the corresponding criteria (determination and uniformity) actually hold for the features being related. (shrink)

This tutorial is for beginners wanting to learn the basics of propositional logic; the simplest of the formal systems of logic. Leslie Allan introduces students to the nature of arguments, validity, formal proofs, logical operators and rules of inference. With many examples, Allan shows how these concepts are employed through the application of three different methods for proving the formal validity of arguments.

The analysis of the reversibility of quantum mechanics depends upon the choice of the time reversal operator for quantum mechanical states. The orthodox choice for the time reversal operator on QM states is known as the Wigner operator, T*, where * performs complex conjugation. The peculiarity is that this is not simply the unitary time reversal operation, but an anti-unitary operator, involving complex conjugation in addition to ordinary time reversal. The alternative choice is the Racah operator, which is simply ordinary (...) time reversal, T. Orthodox treatments hold that it is either logically or empirically necessary to adopt the Wigner operator, and the Racah operator has received little attention. The basis for this choice is analysed in detail, and it is concluded that all the conventional arguments for rejecting the Racah operator and adopting the Wigner operator are mistaken. The additional problem of whether the deterministic part of quantum mechanics should be judged to be reversible or not is also considered. The adoption of the Racah operator for time reversal appears prima facie to entail that quantum mechanics is irreversible. However, it is concluded that the real answer to question depends upon the choice of interpretation of the theory. In any case, the conventional reasons for claiming that quantum mechanics is reversible are incorrect. (shrink)