Logical Connectives

The connective of realisation associates propositions with names of contexts, at which they are said to be realised. Realisation is usually understood as relativised truth-connective, thus under mo...

Graham Priest has recently proposed a solution to the problem of the One and the Many which involves inconsistent objects and a non-transitive identity relation. We show that his solution entails either that the object everything is identical with the object nothing or that they are mutual parts; depending on whether Priest goes for an extensional or a non-extensional mereology.

Can conjunctive propositions be identical without their conjuncts being identical? Can universally quantified propositions be identical without their instances being identical? On a common conception of propositions, on which they inherit the logical structure of the sentences which express them, the answer is negative both times. Here, it will be shown that such a negative answer to both questions is inconsistent, assuming a standard type-theoretic formalization of theorizing about propositions. The result is not specific to conjunction and universal quantification, but (...) applies to any binary operator and propositional quantifier. It is also shown that the result essentially arises out of giving a negative answer to both questions, as each negative answer is consistent by itself. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti’s conditional event, B | A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, (...) we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities, which sometimes reduce to conditional events, given logical dependencies. We also show, for the first time, how to extend the inference of centering for conditional events, inferring B|A from the conjunction A ^ B, to compounds and iterations of both conditional events and biconditional events, B || A, and generalize it to n-conditional events. (shrink)

Modus ponens (from A and “if A then C” infer C) is one of the most basic inference rules. The probabilistic modus ponens allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P(A) and P(C|A) infer P(C)). In this paper, we generalize the probabilistic modus ponens by replacing A by the conditional event A|H. The resulting inference rule involves iterated conditionals (formalized by conditional random quantities) and propagates previsions from the premises to the (...) conclusion. Interestingly, the propagation rules for the lower and the upper bounds on the conclusion of the generalized probabilistic modus ponens coincide with the respective bounds on the conclusion for the (non-nested) probabilistic modus ponens. (shrink)

The aim of this paper is to look at the arguments advanced by three Parisian arts masters about how to understand Prior Analytics II 4 and the more general discussion that medieval authors situate...

The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is lost; nevertheless, (...) we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the presence of two transitive relations (with equality) or three transitive relations (without equality) are undecidable, even for the two-variable sub-fragment. (shrink)

We present an axiomatization of the non-associative Lambek calculus extended with classical negation for which the frame semantics with the classical interpretation of negation is sound and complete.

Arguments have always played a central role within logic and philosophy. But little attention has been paid to arguments as a distinctive kind of discourse, with its own semantics and pragmatics. The goal of this essay is to study the mechanisms by means of which we make arguments in discourse, starting from the semantics of argument connectives such as `therefore'. While some proposals have been made in the literature, they fail to account for the distinctive anaphoric behavior of `therefore', as (...) well as uses of argument connectives in complex arguments, suppositional arguments, arguments with non-declarative conclusions, as well as arguments with parenthetical remarks. A comprehensive account of arguments requires imposing a distinctive tree-like structure on contexts. We show how to extend our account to accommodate modal subordination and and di fferent flavors of `therefore'. (shrink)

In this paper we treat metasequents—objects which stand to sequents as sequents stand to formulas—as first class logical citizens. To this end we provide a metasequent calculus, a sequent calculus which allows us to directly manipulate metasequents. We show that the various metasequent calculi we consider are sound and complete w.r.t. appropriate classes of tetravaluations where validity is understood locally. Finally we use our metasequent calculus to give direct syntactic proofs of various collapse results, closing a problem left open in (...) French, 113–131 2016). (shrink)

Conditional judgements—judgements employing ‘if’—are essential to practical reasoning about what to do, as well as to much reasoning about what is the case. We handle them well enough from an early...

There is a profound, but frequently ignored relationship between logical consequence (formal implication) and material implication. The first repeats the patterns of the latter, but with a wider modal reach. It is argued that this kinship between formal and material implication simply means that they express the same variety of implication, but differ in scope. Formal implication is unrestricted material implication. This apparently innocuous observation has some significant corollaries: (1) conditionals are not connectives, but arguments; (2) the traditional examples of (...) valid argumentative forms are metalogical principles that express the properties of logical consequence; (3) formal logic is not a useful guide to detect valid arguments in the real world; (4) it is incoherent to propose alternatives to the material implication while accepting the classical properties of formal implication; (5) the counter-examples to classical argumentative forms and conditional puzzles are unsound. (shrink)

View more Abstract If logical truth is necessitated by sheer syntax, mathematics is categorially unlike logic even if all mathematics derives from definitions and logical principles. This contrast gets obscured by the plausibility of the Synonym Substitution Principle implicit in conceptions of analyticity: synonym substitution cannot alter sentence sense. The Principle obviously fails with intercepting: nonuniform term substitution in logical sentences. ‘Televisions are televisions’ and ‘TVs are televisions’ neither sound alike nor are used interchangeably. Interception synonymy gets assumed because logical (...) sentences and their synomic interceptions have identical factual content, which seems to exhaust semantic content. However, intercepting alters syntax by eliminating term recurrence, the sole strictly syntactic means of ensuring necessary term coextension, and thereby syntactically securing necessary truth. Interceptional necessity is lexical, a notational artifact. The denial of interception nonsynonymy and the disregard of term recurrence in logic link with many misconceptions about propositions, logical form, conventions, and metalanguages. Mathematics is distinct from logic: its truth is not syntactic; it is transmitted by synonym substitution; term recurrence has no essential role. The ‘=’ of mathematics is an objectual relation between numbers; the ‘=’ of logic marks a syntactic relation of coreferring terms. -/- . (shrink)

The language of Belnap–Dunn modal logic \ expands the language of Belnap–Dunn four-valued logic with the modal operator \. We introduce the polarity semantics for \ and its two expansions \ and \ with value operators. The local finitary consequence relation \ in the language \ with respect to the class of all frames is axiomatized by a sequent system \ where \. We prove by using translations between sequents and formulas that these languages under the polarity semantics have the (...) same expressive power on the level of frames with the language \ under the relational semantics for classical modal logic. (shrink)

Like '&', '=' is no term; it represents no extrasentential property. It marks an atomic, nonpredicative, declarative structure, sentences true solely by codesignation. Identity (its necessity and total reflexivity, its substitution rule, its metaphysical vacuity) is the objectual face of codesignation. The syntax demands pure reference, without predicative import for the asserted fact. 'Twain is Clemens' is about Twain, but nothing is predicated of him. Its informational value is in its 'metailed' semantic content: the fact of codesignation (that 'Twain' names (...) Clemens) that explains what fact it asserts and why it is necessary. Critiques of concepts of rigidity and elimination of singular terms result. (shrink)

We consider a 2-valued non-deterministic connective \ defined by the table resulting from the entry-wise union of the tables of conjunction and disjunction. Being half conjunction and half disjunction we named it platypus. The value of \ is not completely determined by the input, contrasting with usual notion of Boolean connective. We call non-deterministic Boolean connective any connective based on multi-functions over the Boolean set. In this way, non-determinism allows for an extended notion of truth-functional connective. Unexpectedly, this very simple (...) connective and the logic it defines, illustrate various key advantages in working with generalized notions of semantics, calculi and even of logic. We show that the associated logic cannot be characterized by any finite set of finite matrices, whereas with non-determinism two values suffice. Furthermore, this logic is not finitely axiomatizable using single-conclusion rules, however we provide a very simple analytic multiple-conclusion axiomatization using only two rules. Finally, deciding the associated multiple-conclusion logic is \-complete, but deciding its single-conclusion fragment is in \. (shrink)

Este texto presenta, y en cierta medida analiza, ambigüedades existentes en textos de lógica y filosofía de la lógica (como la interpretación de los llamados principios, postulados, leyes o verdades lógicas, la coexistencia de la tesis de que toda relación presupone la existencia de al menos dos relata y la de que una cosa puede relacionarse consigo misma, o la llamada "paradoja del mentiroso") bajo el supuesto de que, dado que la lógica no es anterior a la semántica, un análisis (...) semántico puede mostrar no solo que tal polisemia sugiere que ni la disciplina ni las teorías lógicas son tan rigurosas como se ha afirmado, sino también que varias afirmaciones de esas disciplinas carecen de sentido. (shrink)

Mares and Goldblatt, 163–187, 2006) provided an alternative frame semantics for two quantified extensions of the relevant logic R. In this paper, I show how to extend the Mares-Goldblatt frames to accommodate identity. Simpler frames are provided for two zero-order logics en route to the full logic in order to clarify what is needed for identity and substitution, as opposed to quantification. I close with a comparison of this work with the Fine-Mares models for relevant logics with identity and a (...) discussion of constant and variable domains. (shrink)

Numerical identity is standardly considered to be a relation between things. This means that two things are identical if they are only one thing. It is not only Wittgenstein who finds this claim rather odd. Another possibility is to understand identity as a relation between names which denote the same thing; or as a relation between the senses of those names which are modes of presentation of the same thing. Or identity statements can be considered as expressions of the fact (...) that there is exactly one thing that has certain characteristics. These conceptions are, in fact, closely interlinked. There are some rather straightforward proposals on how to give these approaches a formal pattern in relative harmony with classical logic. What is important to emphasize and keep in mind is the specific character of identity and essential dissimilarities between identity and relations of objects in logic. (shrink)

Since Sun-Joo Shin's groundbreaking study (2002), Peirce's existential graphs have attracted much attention as a way of writing logic that seems profoundly different from our usual logical calculi. In particular, Shin argued that existential graphs enjoy a distinctive property that marks them out as "diagrammatic": they are "multiply readable," in the sense that there are several di erent, equally legitimate ways to translate one and the same graph into a standard logical language. Stenning (2000) and Bellucci and Pietarinen (2016) have (...) retorted that similar phenomena of multiple readability can arise for sentential notations as well. Focusing on the simplest kinds of existential graphs, called alpha graphs (AGs), this paper argues that multiple readability does point to important features of AGs, but that both Shin and her critics have misdiagnosed its source. As a preliminary, and because the existing literature often glosses over such issues, we show that despite their non-linearity, AGs are uniquely parsable and allow for inductive de nitions. Extending earlier discussions, we then show that that in principle, all propositional calculi are multiply readable, just like AGs: contrary to what has been suggested in the literature, multiple readability is linked neither to non-linearity nor to AGs' dearth of connectives. However, we argue that in practice, AGs are more amenable to multiple readability than our usual notations, because the patterns that one needs to recognize to multiply translate an AG form what we call complex symbols, whose structural properties make it easy to perceive and process them as units. Nevertheless, we show that such complex symbols, though largely absent from our usual notations, are not inherently diagrammatic and can be found in seemingly sentential languages. Hence, while ultimately vindicating Shin's idea of multiple readability, our analysis traces it to a di erent source and thus severs its link with diagrammaticity. (shrink)

In this paper, we present two variants of Peirce’s Triadic Logic within a language containing only conjunction, disjunction, and negation. The peculiarity of our systems is that conjunction and disjunction are interpreted by means of Peirce’s mysterious binary operations Ψ and Φ from his ‘Logical Notebook’. We show that semantic conditions that can be extracted from the definitions of Ψ and Φ agree (in some sense) with the traditional view on the semantic conditions of conjunction and disjunction. Thus, we support (...) the conjecture that Peirce’s special interest in these operations is due to the fact that he interpreted them as conjunction and disjunction, respectively. We also show that one of our systems may serve as a suitable base for an interesting implicative expansion, namely the connexive three-valued logic by Cooper. Sound and complete natural deduction calculi are presented for all systems examined in this paper. (shrink)

However broad or vague the notion of connexivity may be, it seems to be similar to the notion of relevance even when relevance and connexive logics have been shown to be incompatible to one another. Relevance logics can be examined by suggesting syntactic relevance principles and inspecting if the theorems of a logic abide to them. In this paper we want to suggest that a similar strategy can be employed with connexive logics. To do so, we will suggest some properties (...) that seem to be hinted at in Nelson’s work. Following this strategy will ideally shed some light over the notion of content and will also help make a clear comparison between relevance and connexive logics. (shrink)

This paper formulates a bilateral account of harmony, which is an alternative to the one proposed by Francez. It builds on an account of harmony for unilateral logic proposed by Kürbis and the observation that reading some of the rules for the connectives of bilateral logic bottom up gives the grounds and consequences of formulas with the opposite speech act. Thus the consequences of asserting a formula give grounds for denying it, namely if the opposite speech act is applied to (...) the consequences. Similarly, the consequences of denying a formula give grounds for asserting the formula. I formulate a process of inversion, which allows the determination of assertive elimination rules from assertive introduction rules, and rejective elimination rules from rejective introduction rules, and conversely. It corresponds to Francez's notion of vertical harmony. I also formulate a process of conversion, which allows the determination of rejective introduction rules from certain assertive elimination rules and conversely, and the determination for assertive introduction rules from certain rejective elimination rules and conversely. It corresponds to Francez's notion of horizontal harmony. (shrink)

This paper develops a probabilistic analysis of conditionals which hinges on a quantitative measure of evidential support. In order to spell out the interpreta- tion of ‘if’ suggested, we will compare it with two more familiar interpretations, the suppositional interpretation and the strict interpretation, within a formal framework which rests on fairly uncontroversial assumptions. As it will emerge, each of the three interpretations considered exhibits specific logical features that deserve separate consideration.

ion turns equivalence into identity, but there are two ways to do it. Given the equivalence relation of parallelness on lines, the #1 way to turn equivalence into identity by abstraction is to consider equivalence classes of parallel lines. The #2 way is to consider the abstract notion of the direction of parallel lines. This paper developments simple mathematical models of both types of abstraction and shows, for instance, how finite probability theory can be interpreted using #2 abstracts as “superposition (...) events” in addition to the ordinary events. The goal is to use the second notion of abstraction to shed some light on the notion of an indefinite superposition in quantum mechanics. (shrink)

This paper investigates the meaning of restricted quantification when the embedded conditional is taken as the conditional of some first-order connexive logics. The study is carried out by checking the suitability of RQ for defining a connexive class theory, in analogy to the definition of Boolean class theory by using RQ in classical logic. Negative results are obtained for Wansing’s first-order connexive logic QC and one variant of Priest’s first-order connexive logic QP. A positive result is obtained for another variant (...) of QP. (shrink)

In this paper, we propose a new kind of nonprioritized operator which we call two level credibility-limited revision. When revising through a two level credibility-limited revision there are two levels of credibility and one of incredibility. When revising by a sentence at the highest level of credibility, the operator behaves as a standard revision, if the sentence is at the second level of credibility, then the outcome of the revision process coincides with a standard contraction by the negation of that (...) sentence. If the sentence is not credible, then the original belief set remains unchanged. In this article, we axiomatically characterize several classes of two level credibility-limited revision operators. (shrink)

In “Lectio 55” of his Notule libri Priorum, Robert Kilwardby discussed various objections that had been raised against Aristotle’s Theses. The first thesis, AT1, says that no proposition q is implied both by a proposition p and by its negation, ∼p. AT2 says that no proposition p is implied by its own negation. In Prior Analytics, Aristotle had shown that AT2 entails AT1, and he argued that the assumption of a proposition p such that (∼p → p) would be “absurd”. (...) The unrestricted validity of AT1, AT2, however, is at odds with other principles which were widely accepted by medieval logicians, namely the law Ex Impossibili Quodlibet, EIQ, and the rules of disjunction introduction. Since, according to EIQ, the impossible proposition (p ∧ ∼p) implies every proposition, it also implies ∼(p∧∼p), in contradiction to AT2. Furthermore, by way of disjunction introduction, the proposition (p∨∼p) is implied both by p and by ∼p, in contradiction to AT1. Kilwardby tried to defend AT1, AT2 against these objections by claiming that EIQ holds only for accidental but not for natural implications. The second argument, however, cannot be refuted in this way because Kilwardby had to admit that every disjunction (p ∨ q) is naturally implied by its disjuncts. He therefore introduced the further requirement that, in order to constitute a genuine counterexample to AT1, (p → q) and (∼p → q) have to hold “by virtue of the same thing”. In a recently published paper, Spencer Johnston accepted this futile defence of AT1 and developed a formal semantics that would fit Kilwardby’s presumably connexive implication. This procedure, however, is misguided because the remaining considerations of Lesson 55  which were entirely ignored by Johnston  show that Kilwardby eventually recognized that AT2 is bound to fail. After all he concluded: “So it should be granted that from the impossible its opposite follows, and that the necessary follows from its opposite”. (shrink)

A globally expressivist analysis of the indicative conditional based on the Ramsey Test is presented. The analysis is a form of ‘global’ expressivism in that it supplies acceptance and rejection conditions for all the sentence forming connectives of propositional logic and so allows the conditional to embed in arbitrarily complex sentences. The expressivist framework is semantically characterized in a restrictor semantics due to Vann McGee, and is completely axiomatized in a logic dubbed ICL. The expressivist framework extends the AGM framework (...) for belief revision and so provides a categorical epistemology for conditionals that complements McGee’s probabilistic framework while drawing on the same semantics. The result is an account of the semantics and acceptability conditions of the indicative conditional that fits well with the linguistic data while integrating both expressivist and semanticist perspectives. (shrink)

Is identity fundamental to every conceptual systems? In this article I intend to present reasons against the claim that every conceptual system presupposes the notion of identity. To address this debate I analyze the positions of Bueno (2014; 2016) and Krause and Arenhart (2015). While Bueno argues that identity is necessary for all conceptual systems, Krause and Arenhart present a series of objections against such position, thus defending that identity is not fundamental. I intend to show that the main objections (...) presented by Krause and Arenhart do not affect Bueno’s theory because of a misinterpretation of his arguments. Finally, I will present some objections against Bueno that, hopefully, does not miss the target. (shrink)

Is identity fundamental to formal systems? Even if a system have no the identity relation, is that concept is not assumed in any way – whether in a metalinguistic or intuitive level? In this paper we shall discuss this issue. Otávio Bueno (2014, 2016) argues against the elimination of identity, holding that this concept is fundamental and non-eliminable (even in does systems that claim to do so). Décio Arenhart Krause and Jonas (2015), by the other hand, have a number of (...) objections to Bueno’s thesis. Firstly, we look at how the concept of identity was accounted in the philosophical tradition, as well as part of its formal account. We will also examine the notion of indiscernibility that, according to the traditional approach to identity, is equivalent to the notion of identity, but (arguably) is not it logically equivalent. Thus, we shall state Krause and Arenhart’s strategy, according to, in a formal system we can eliminate identity in favor of the indiscernibility notion. Finally, we shall expose Bueno’s criticism to such strategy, and then to put forward some objections against it. (shrink)

Identity is traditionally taken to be a fundamental notion of our conceptual framework as well as a fundamental metaphysical component of entities. But as far as we make this claim we face ourselves with two problems: what is identity? And why would it be fundamental? These questions will guide us towards a discussion put forward by Bueno (2014), Krause and Arenhart (2015). Bueno holds that there are four aspects that make identity being fundamental: (1) identity is assumed in every conceptual (...) system; (2) it is required for a minimal characterisation of being an individual; (3) it cannot be defined; and (4) identity is required for quantification. On the other hand, Krause and Arenhart refuse the thesis that identity is fundamental replying to Bueno's arguments. In this dissertation we will deal with this debate. In the introduction we will deal with the first problem what is identity? , showing how this concept is traditionally understood, either for its metaphysical characteristics as for its formal account. After that we will deal with each of the four aspects defended by Bueno and challenged by Krause and Arenhart. After a critical presentation of each position we will also provide other arguments for the current debate. Finally we will outline an alternative view to those defended throughout this work. -/- . (shrink)

Reverse mathematics is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, that is, non-set-theoretic, mathematics. As suggested by the title, this paper deals with two RM-phenomena, namely, splittings and disjunctions. As to splittings, there are some examples in RM of theorems A, B, C such that A↔, that is, A can be split into two (...) independent parts B and C. As to disjunctions, there are examples in RM of theorems D, E, F such that D↔, that is, D can be written as the disjunction of two independent parts E and F. By contrast, we show in this paper that there is a plethora of splittings and disjunctions in Kohlenbach’s higher-order RM. (shrink)

This paper considers some issues to do with valuational presentations of consequence relations, and the Galois connections between spaces of valuations and spaces of consequence relations. Some of what we present is known, and some even well-known; but much is new. The aim is a systematic overview of a range of results applicable to nonreflexive and nontransitive logics, as well as more familiar logics. We conclude by considering some connectives suggested by this approach.

It has long been recognized that negation in Aristotle’s term logic differs syntactically from negation in classical logic: modern external negation attaches to propositions fully formed, whereas Aristotelian internal negation forms propositions from sentential constituents. Still, modern external negation is used to render Aristotelian internal negation, as may be seen in formalizations of Aristotle’s semantic principles of non-contradiction and of excluded middle. These principles govern the distribution of truth values among pairs of contradictory propositions, and Aristotelian contradictories always consist of (...) an affirmation and a denial. So how should we formalize a false denial? In the literature, we find that a false denial is formalized by means of two negation signs attached to a one-place predicate. However, it can be shown that this rendering leads to an incorrect picture of Aristotle’s principles. In this paper, I propose a solution to this technical problem by devising a formal notation especially for Aristotelian propositions in which internal negation is differentiated from external negation. I will also analyze both principles, each of which has two logically equivalent forms, a positive and a negative one. The fact that Aristotle’s principles are distinct and complementary is reflected in my new formalizations. (shrink)

Following a suggestion of Feys, we use “rigorous implication” as a translation of Ackermann's strenge Implikation ([1]). Interest in Ackermann's system stems in part from the fact that it formalizes the properties of a strong, natural sort of implication which provably avoids standard implicational paradoxes, and which is consequently a good candidate for a formalization of entailment (considered as a narrower relation than that of strict implication). Our present purpose will not be to defend this suggestion, but rather to present (...) some information about rigorous implication. In particular, we show first that the structure of modalities (in the sense of Parry [4]) in Ackermann's system is identical with the structure of modalities in Lewis's S4, and secondly that (Ackermann's apparent conjecture to the contrary notwithstanding) it is possible to define modalities with the help of rigorous implication. (shrink)

There is a well-documented paradigm-shift in eighteenth century Jesuit philosophy and science, at the very least in Central Europe: traditional scholastic version of Aristotelianism were replaced by early modern rationalism and early modern science and mathematics. In the field of probability, this meant that the traditional Jesuit engagement with probability, uncertainty, and truthlikeness could translate into mathematical language, and can be analysed against the background of the accounts of probability, pre-mathematical Jesuit logic, Wolff's conceptual analysis, and Bernoullian mathematisation. The works (...) of two Jesuit philosophers, Berthold Hauser and Sigismund Storchenau, can be related to this context. The core of their logic of probability is the account of negation and implication, in particular, the algorithms for computing the reliability of one piece of evidence when compared to the respective counter-evidence and for computing the probability of a conclusion given the probability of its premises. (shrink)

Review of the paper by Rose mentioned in the title.

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)

This paper discusses the philosophical and logical motivations for rejectivism, primarily by considering a dialogical approach to logic, which is formalized in a Question–Answer Semantics. We develop a generalized account of rejectivism through close consideration of Mark Textor's arguments against rejectivism that the negative expression ‘No’ is never used as an act of rejection and is equivalent with a negative sentence. In doing so, we also shed light upon well-known issues regarding the supposed non-embeddability and non-iterability of force indicators.