The de Morgan laws characterize how negation, conjunction, and disjunction interact with each other. They are fundamental in any semantics that bases itself on the propositional calculus/Boolean algebra. This paper is primarily concerned with the second law. In English, its validity is easy to demonstrate using linguistic examples. Consider the following: (3) Why is it so cold in here? We didn’t close the door or the window. The second sentence is ambiguous. It may mean that I suppose we did (...) not close the door or did not close the window, but I am not sure which. This `I am not sure which’ reading is irrelevant to us because it has disjunction scoping over negation. But the sentence may equally well mean (and indeed this is the preferred reading) that we didn’t close the door and did not close the window. This `neither’ reading bears out de Morgan law (2). (shrink)

In the present paper, we prove the normalization theorem and the consistency of the first-order classical logic with disjunctive syllogism. First, we propose the natural deduction system SCD for classical propositional logic having rules for conjunction, implication, negation, and disjunction. The rules for disjunctive syllogism are regarded as the rules for disjunction. After we prove the normalization theorem and the consistency of SCD, we extend SCD to the system SPCD for the first-order classical logic with disjunctive syllogism. It (...) can be shown that SPCD is conservative extension to SCD. Then, the normalization theorem and the consistency of SPCD are given. (shrink)

Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the (...) lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the notions of disjunction and iterated conditioning and we show that the usual probabilistic properties still hold. (shrink)

The central topic of this inquiry is a cross-linguistic contrast in the interaction of conjunction and negation. In Hungarian (Russian, Serbian, Italian, Japanese), in contrast to English (German), negated definite conjunctions are naturally and exclusively interpreted as `neither’. It is proposed that Hungarian-type languages conjunctions simply replicate the behavior of plurals, their closest semantic relatives. More puzzling is why English-type languages present a different range of interpretations. By teasing out finer distinctions in focus on connectives, syntactic structure, and context, the (...) paper tracks down missing readings and argues that it is eventually not necessary to postulate a radical cross-linguistic semantic difference. In the course of making that argument it is observed that negated conjunctions on the `neither’ reading carry the expectation that the predicate hold of both conjuncts. The paper investigates several hypotheses concerning the source of this expectation. (shrink)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; (...) in particular we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

An implication relation between pictures is defined, it is then shown how conjunctions, disjunctions, negations, and hypotheticals of pictures can be formed on the basis of this. It is argued that these logical operations on pictures correspond to natural cognitive operations employed when thinking about pictures.

In this paper we discuss the extent to which conjunction and disjunction can be rightfully regarded as such, in the context of infectious logics. Infectious logics are peculiar many-valued logics whose underlying algebra has an absorbing or infectious element, which is assigned to a compound formula whenever it is assigned to one of its components. To discuss these matters, we review the philosophical motivations for infectious logics due to Bochvar, Halldén, Fitting, Ferguson and Beall, noticing that none of them (...) discusses our main question. This is why we finally turn to the analysis of the truth-conditions for conjunction and disjunction in infectious logics, employing the framework of plurivalent logics, as discussed by Priest. In doing so, we arrive at the interesting conclusion that —in the context of infectious logics— conjunction is conjunction, whereas disjunction is not disjunction. (shrink)

This paper is a response to replies by Dan López de Sa and Mark Jago to my ‘Truthmaking, Entailment, and the Conjuction Thesis’. In that paper, my main aim was to argue against the Entailment Principle by arguing against the Conjunction Thesis, which is entailed by the Entailment Principle. In the course of so doing, although not essential for my project in that paper, I defended the Disjunction Thesis. López de Sa has objected both to my defence of the (...) Disjunction Thesis and my case against the Conjunction Thesis. I shall show that his objections are unfounded and based on serious misunderstandings of my position, what the relevant debate is, and some fundamental notions of Truthmaker Theory. Jago argues that accepting the Disjunction Thesis and rejecting the Conjunction Thesis is hard to maintain. But I show that Jago has not shown that accepting the Disjunction Thesis while rejecting the Conjunction Thesis is impossible or even hard to maintain. Jago believes that, to accept the Disjunction Thesis while rejecting the Conjunction Thesis, one needs to reject his axiom (T3), which says that all the truthmakers for <P&P> are truthmakers for <P>. I argue that there are reasons to reject such a principle, and the version of it that says that what makes <P&P> true makes <P> true. (shrink)

Rodriguez-Pereyra (2006) argues for the disjunction thesis but against the conjunction thesis. I argue that accepting the disjunction thesis undermines his argument against the conjunction thesis.

I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specific states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I then (...) investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. (shrink)

Departing from basic concepts in abstract logics, this paper introduces two concepts: conjunctive and disjunctive limits. These notions are used to formalize levels of modal operators.

This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give a (...) meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

Scientists often adjust their significance threshold during null hypothesis significance testing in order to take into account multiple testing and multiple comparisons. This alpha adjustment has become particularly relevant in the context of the replication crisis in science. The present article considers the conditions in which this alpha adjustment is appropriate and the conditions in which it is inappropriate. A distinction is drawn between three types of multiple testing: disjunction testing, conjunction testing, and individual testing. It is argued that (...) alpha adjustment is only appropriate in the case of disjunction testing, in which at least one test result must be significant in order to reject the associated joint null hypothesis. Alpha adjustment is inappropriate in the case of conjunction testing, in which all relevant results must be significant in order to reject the joint null hypothesis. Alpha adjustment is also inappropriate in the case of individual testing, in which each individual result must be significant in order to reject each associated individual null hypothesis. The conditions under which each of these three types of multiple testing is warranted are examined. It is concluded that researchers should not automatically assume that alpha adjustment is necessary during multiple testing. Illustrations are provided in relation to joint studywise hypotheses and joint multiway ANOVAwise hypotheses. (shrink)

This article is a preliminary presentation of conjunctive paraconsistency, the claim that there might be non-explosive true contradictions, but contradictory propositions cannot be considered separately true. In case of true ‘p and not p’, the conjuncts must be held untrue, Simplification fails. The conjunctive approach is dual to non-adjunctive conceptions of inconsistency, informed by the idea that there might be cases in which a proposition is true and its negation is true too, but the conjunction is untrue, Adjunction fails. While (...) non-adjunctivism is a well-known option, the other view is not so much studied nowadays, but it was not unknown in the tradition, and there are some positive suggestions, in recent literature, that the position is plausible and deserves to be developed. The article compares conjunctivism, non-adjunctivism and dialetheism, then focuses on some possible justifications, costs and benefits of the conjunctive view. (shrink)

Fine (2017a) sets out a theory of content based on truthmaker semantics which distinguishes two kinds of consequence between contents. There is entailment, corresponding to the relationship between disjunct and disjunction, and there is containment, corresponding to the relationship between conjunctions and their conjuncts. Fine associates these with two notions of parthood: disjunctive and conjunctive. Conjunctive parthood is a very useful notion, allowing us to analyse partial content and partial truth. In this chapter, I extend the notion of disjunctive (...) parthood in terms of a structural relation of refinement, which stands to disjunctive parthood much as mereological parthood stands to conjunctive parthood. Philosophically, this relation may be modelled on the determinable- determinate relation, or on a fact-to-fact notion of grounding. I discuss its connection to two other Finean notions: vagueness (understood via precisification) and arbitrary objects. I then investigate what a logic of truthmaking with refinement might look like. I argue that (i) parthood naturally gives rise to a relevant conditional; (ii) refinement underlies a relevant notion of disjunction; and so (iii) truthmaker semantics with refinement is a natural home for relevant logic. The resulting formal models draw on Fine’s (1974) semantics for relevant logics. Finally, I use this understanding of relevant semantics to investigate the status of the mingle axiom. (shrink)

There is a curious bifurcation in the literature on ground and its logic. On the one hand, there has been a great deal of work that presumes that logical complexity invariably yields grounding. So, for instance, it is widely presumed that any fact stated by a true conjunction is grounded in those stated by its conjuncts, that any fact stated by a true disjunction is grounded in that stated by any of its true disjuncts, and that any fact stated (...) by a true double negation is grounded in that stated by the doubly-negated formula. This commitment is encapsulated in the system GG axiomatized and semantically characterized by [deRosset and Fine, 2023] (following [Fine, 2012]). On the other hand, there has been a great deal of important formal work on “flatter” theories of ground, yielding logics very different from GG [Correia, 2010] [Fine, 2016, 2017b]. For instance, these theories identify the fact stated by a self-conjunction $$(\phi \wedge \phi )$$ with that stated by its conjunct $$\phi $$. Since, in these systems, no fact grounds itself, the “flatter” theories are inconsistent with the principles of GG. This bifurcation raises the question of whether there is a single notion of ground suited to fulfill the philosophical ambitions of grounding enthusiasts. There is, at present, no unified semantic framework employing a single conception of ground for simultaneously characterizing both GG and the “flatter” approaches. This paper fills this gap by specifying such a framework and demonstrating its adequacy. (shrink)

There are two ways of understanding the notion of a contradiction: as a conjunction of a statement and its negation, or as a pair of statements one of which is the negation of the other. Correspondingly, there are two ways of understanding the Law of Non-Contradiction (LNC), i.e., the law that says that no contradictions can be true. In this paper I offer some arguments to the effect that on the first (collective) reading LNC is non-negotiable, but on the second (...) (distributive) reading it is perfectly plausible to suppose that LNC may, in some rather special and perhaps undesirable circumstances, fail to hold. (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)

I start out by reviewing the semantics of ‘seem’. As ‘seem’ is a subject-raising verb, ‘it seems’ can be treated as a sentential operator. I look at the semantic and logical properties of ‘it seems’. I argue that ‘it seems’ is a hyperintensional and contextually flexible operator. The operator distributes over conjunction but not over disjunction, conditionals or semantic entailments. I further argue that ‘it seems’ does not commute with negation and does not agglomerate with conjunction. I then show (...) that the mental states expressed by perceptual uses of ‘seem’ have non-conceptual, yet perspectival contents. In the final part of the paper I argue that while the content of the mental states expressed by perceptual uses of ‘seem’ are non-conceptual, having a mental state of this type requires possessing conceptual abilities corresponding to what the mental state represents. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in (...) which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

(English translation of ...) This paper points out naturally-occurring examples, primarily in Hungarian but also to a more limited extent in English, in which disjunction (i) has a conjunctive force but (ii) its use highlights that the list is not intended to be exhaustive. The preliminary analysis is in terms of recursive proposition strengthening by exhaustification without a scalar alternative, assimilating exemplifications to known cases of conjunctively interpreted disjunctions in other languages.

Several commentators have recently attributed conflicting accounts of the relation between veridical perceptual experience and hallucination to Husserl. Some say he is a proponent of the conjunctive view that the two kinds of experience are fundamentally the same. Others deny this and purport to find in Husserl distinct and non-overlapping accounts of their fundamental natures, thus committing him to a disjunctive view. My goal is to set the record straight. Having briefly laid out the problem under discussion and the terms (...) of the debate, I then review the proposals that have been advanced, disposing of some and marking others for further consideration. A.D. Smith’s disjunctive reading is among the latter. I discuss it at length, arguing that Smith fails to show that Husserl’s views on perceptual experience entail a form of disjunctivism. Following that critical discussion, I present a case for a conjunctive reading of Husserl’s account of perceptual experience. (shrink)

According to an influential view, when it comes to representing reality, some words are better suited for the job than others. This is elitism. There is reason to believe that the set of the best, or elite, words should not be redundant or arbitrary. However, we are often forced to choose between these two theoretical vices, especially in cases involving theories that seem to be mere notational variants. This is the riddle of redundancy: both redundancy and arbitrariness are vicious, but (...) there are cases in which one must be picked. Logical realists admit that there are some logical constants among the elite words. This leads to awkward questions, such as which among conjunction and disjunction is elite. In this paper, I show how the riddle of redundancy arises for logical realists, and offer a solution. This approach requires us to change how we represent negation. Instead of using some particular symbol, we represent negation by flipping formulae over the horizontal axis. (shrink)

ABSTRACT: An introduction to Stoic logic. Stoic logic can in many respects be regarded as a fore-runner of modern propositional logic. I discuss: 1. the Stoic notion of sayables or meanings (lekta); the Stoic assertibles (axiomata) and their similarities and differences to modern propositions; the time-dependency of their truth; 2.-3. assertibles with demonstratives and quantified assertibles and their truth-conditions; truth-functionality of negations and conjunctions; non-truth-functionality of disjunctions and conditionals; language regimentation and ‘bracketing’ devices; Stoic basic principles of propositional logic; 4. (...) Stoic modal logic; 5. Stoic theory of arguments: two premisses requirement; validity and soundness; 6. Stoic syllogistic or theory of formally valid arguments: a reconstruction of the Stoic deductive system, which consisted of accounts of five types of indemonstrable syllogisms, which function as nullary argumental rules that identify indemonstrables or axioms of the system, and four deductive rules (themata) by which certain complex arguments can be reduced to indemonstrables and thus shown to be formally valid themselves; 7. arguments that were considered as non-syllogistically valid (subsyllogistic and unmethodically concluding arguments). Their validity was explained by recourse to formally valid arguments. (shrink)

I argue for the thesis (UL) that there are certain logical abilities that any rational creature must have. Opposition to UL comes from naturalized epistemologists who hold that it is a purely empirical question which logical abilities a rational creature has. I provide arguments that any creatures meeting certain conditions—plausible necessary conditions on rationality—must have certain specific logical concepts and be able to use them in certain specific ways. For example, I argue that any creature able to grasp theories must (...) have a concept of conjunction subject to the usual introduction and elimination rules. I also deal with disjunction, conditionality and negation. Finally, I put UL to work in showing how it could be used to define a notion of logical obviousness that would be well suited to certain contexts—e.g. radical translation and epistemic logic—in which a concept of obviousness is often invoked. (shrink)

Natural language contains simple lexical items for some but not all Boolean operators. English, for example, contains conjunction and, disjunction or, negated disjunction nor, but no word to express negated conjunction *nand nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described here as a bilateral extension of update semantics. The basic intuition is (...) that a context can be updated by assertion or by rejection, and by one or multiple propositions at once. These distinctions suffice to characterize the logic of the lexicon. (shrink)

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory (...) or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”. (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and provide a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on (...) nothing but equivalence transformations within pure first-order logic (FOL). This procedure involves the application of a calculus for negative normal forms (the NNF-calculus) with A -||- A & A (= &I) as the sole rule that increases the complexity of given FOLDNFs. The described algorithm illustrates how, in the case of Herbrand formulae, decision problems can be solved through a systematic search for proofs that reduce the number of applications of the rule &I to a minimum in the NNF-calculus. In the case of Herbrand formulae, it is even possible to entirely abstain from applying &I. Finally, it is shown how the described procedure can be used within an optimized general search for proofs of contradiction and what kind of questions arise for a &I-minimal proof strategy in the case of a general search for proofs of contradiction. (shrink)

This paper investigates the interaction of phenomena associated with loose talk with embedded contexts. §1. introduces core features associated with the loose interpretation of an utterance and presents a sketch of how to theorise about such utterances in terms of a relation of ‘pragmatic equivalence’. §2. discusses further features of loose talk arising from interaction with ‘loose talk regulators’, negation and conjunction. §§3-4. introduce a hybrid static/dynamic framework and show how it can be employed in developing a fragment which accounts (...) for the data surveyed in §§1-2. (shrink)

Causal Modeling Semantics (CMS, e.g., Galles and Pearl 1998; Pearl 2000; Halpern 2000) is a powerful framework for evaluating counterfactuals whose antecedent is a conjunction of atomic formulas. We extend CMS to an evaluation of the probability of counterfactuals with disjunctive antecedents, and more generally, to counterfactuals whose antecedent is an arbitrary Boolean combination of atomic formulas. Our main idea is to assign a probability to a counterfactual (A ∨ B) > C at a causal model M as a weighted (...) average of the probability of C in those submodels that truthmake A∨ B (Briggs 2012; Fine 2016, 2017). The weights of the submodels are given by the inverse distance to the original model M, based on a distance metric proposed by Eva, Stern, and Hartmann (2019). Apart from solving a major problem in the epistemology of counterfactuals, our paper shows how work in semantics, causal inference and formal epistemology can be fruitfully combined. (shrink)

Section 1 provides a brief summary of the pair-list literature singling out some points that are particularly relevant for the coming discussion. -/- Section 2 shows that the dilemma of quantifi cation versus domain restriction arises only in extensional complement interrogatives. In matrix questions and in intensional complements only universals support pairlist readings, whence the simplest domain restriction treatment suffices. Related data including conjunction, disjunction, and cumulative readings are discussed -/- Section 3 argues that in the case of extensional (...) complements the domain restriction treatment is inadequate for at least two independent reasons. One has to do with the fact that not only upward monotonic quantifi ers support pairlist readings, and the other with the derivation of apparent scope out readings. The reasoning is supplemented with some discussion of the semantic properties of layered quantifi ers.  The above will establish the need for quantifi cation, so the question arises how the objections explicitly enlisted in the literature against quantifi cation can be answered. Section 4 considers the de dicto reading of the quantifi er s restriction, quanti cational variability, and the absence of pairlist readings with whether questions, and argues that they need not militate against the quanti ficational analysis. -/- Section 5 summarizes the emergent proposal -/- Finally, section 6 discusses the signifi cance of the above findings for the behavior of weak islands. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic with (...) implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

This paper investigates a generalization of Boolean algebras which I call agglomerative algebras. It also outlines two conceptions of propositions according to which they form an agglomerative algebra but not a Boolean algebra with respect to conjunction and negation.

Surányi (2006) observed that Hungarian has a hybrid (strict + non-strict) negative concord system. This paper proposes a uniform analysis of that system within the general framework of Zeijlstra (2004, 2008) and, especially, Chierchia (2013), with the following new ingredients. Sentential negation NEM is the same full negation in the presence of both strict and non-strict concord items. Preverbal SENKI `n-one’ type negative concord items occupy the specifier position of either NEM `not' or SEM `nor'. The latter, SEM spells out (...) IS `too, even’ in the immediate scope of negation; it is a focus-sensitive head on the clausal spine. SEM can be seen as an overt counterpart of the phonetically null head that Chierchia dubs NEG; it is capable of invoking an abstract (disembodied) negation at the edge of its projection. (shrink)

States of affairs raise, among others, the following questions: What kind of entity are they (if there are any)? Are they contingent, causally efficacious, spatio-temporal and perceivable entities, or are they abstract objects? What are their constituents and their identity conditions? What are the functions that states of affairs are able to fulfil in a viable theory, and which problems and prima facie counterintuitive consequences arise out of an ontological commitment to them? Are there merely possible (non-actual, non-obtaining) states of (...) affairs? Are there molecular (i.e., negative, conjunctive, disjunctive etc.) states of affairs? Are there modal and tensed states of affairs? (shrink)

ABSTRACT: A detailed presentation of Stoic logic, part one, including their theories of propositions (or assertibles, Greek: axiomata), demonstratives, temporal truth, simple propositions, non-simple propositions(conjunction, disjunction, conditional), quantified propositions, logical truths, modal logic, and general theory of arguments (including definition, validity, soundness, classification of invalid arguments).

Quasi-Nelson logic (QNL) was recently introduced as a common generalisation of intuitionistic logic and Nelson's constructive logic with strong negation. Viewed as a substructural logic, QNL is the axiomatic extension of the Full Lambek Calculus with Exchange and Weakening by the Nelson axiom, and its algebraic counterpart is a variety of residuated lattices called quasi-Nelson algebras. Nelson's logic, in turn, may be obtained as the axiomatic extension of QNL by the double negation (or involutivity) axiom, and intuitionistic logic as the (...) extension of QNL by the contraction axiom. A recent series of papers by the author and collaborators initiated the study of fragments of QNL, which correspond to subreducts of quasi-Nelson algebras. In the present paper we focus on fragments that contain the connectives forming a residuated pair (the monoid conjunction and the so-called strong Nelson implication), these being the most interesting ones from a substructural logic perspective. We provide quasi-equational (whenever possible, equational) axiomatisations for the corresponding classes of algebras, obtain twist representations for them, study their congruence properties and take a look at a few notable subvarieties. Our results specialise to the involutive case, yielding characterisations of the corresponding fragments of Nelson's logic and their algebraic counterparts. (shrink)

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents generated by $n$ conditional events and (...) we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula, which can be interpreted by introducing a suitable distributive property. Moreover, under logical independence of basic unconditional events, we give two necessary and sufficient coherence conditions. The first condition gives a geometrical characterization for the coherence of prevision assessments on a family F constituted by n conditional events and all possible conjunctions among them. The second condition characterizes the coherence of prevision assessments defined on $F\cup K$, where $K$ is the set of conditional constituents associated with the conditional events in $F$. Then, we give some further theoretical results and we examine some examples and counterexamples. Finally, we make a comparison with other approaches and we illustrate some theoretical aspects and applications. (shrink)

We investigate adverbial agreement in Sandəmarkesə (S. Marco in Lamis, Apulia) proposing phase-bound, local agreement relations, reducible to coordination, as in past and absolute participial constructions, suggesting a copulaless analysis where arguments are subjects in a small clause. With disjunct nominals with matching φ-features, the adverb agrees separately with each part in the set, otherwise resulting in ‘non-agreeing’ forms, which we test also with negative polarity items (niʃun-, ‘nobody’ and nentə, ‘nothing’). With fragment answers, the negation scopes over adverbs agreeing (...) with the two proposed topics: matching of the φ-features of both nouns values the negative operator with the same features. In fronted adverbs, agreement occurs when the question contains overt coordinated arguments, elements continuing a chain, and if coordinated arguments have matching φ-features. In agreement in topical contexts with fronted adverbs, agreement occurs with the aboutness-shift topic closely preceding them, rather than with the embedded direct object. (shrink)

This paper is about conjunctions and disjunctions in the scope of non-doxastic atti- tude verbs. These constructions generate a certain type of ignorance implicature. I argue that the best way to account for these implicatures is by appealing to a notion of contex- tual redundancy (Schlenker, 2008; Fox, 2008; Mayr and Romoli, 2016). This pragmatic approach to ignorance implicatures is contrasted with a semantic account of disjunctions under `wonder' that appeals to exhausti cation (Roelofsen and Uegaki, 2016). I argue that (...) exhausti cation-based theories cannot handle embedded conjunctions, so a pragmatic account of ignorance implicatures is superior. (shrink)

Advocates of Expressivism about basically any kind of language are best-served by abandoning a traditional content-centric approach to semantic theorizing, in favor of an update-centric or dynamic approach (or so this paper argues). The type of dynamic approach developed here — in contrast to the content-centric approach — is argued to yield canonical, if not strictly classical, "explanations" of the core semantic properties of the connectives. (The cases on which I focus most here are negation and disjunction.) I end (...) the paper by describing a distinctive sense in which mental states might play a fundamental role in the practice of semantic theorizing (as I understand it), and I connect this to a distinctive account of the pragmatic function of, e.g., a normatively laden claim in discourse. (shrink)

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a sigma-algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. One might be interested in the probability of rain and that of an interest-rate increase, but not in the probability of rain (...) or an interest-rate increase. We characterize linear pooling and neutral pooling for general agendas, with classic results as special cases for agendas that are sigma-algebras. As an illustrative application, we also consider probabilistic preference aggregation. Finally, we compare our results with existing results on binary judgment aggregation and Arrovian preference aggregation. This paper is the first of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory although their (...) properties can be time-dependent (when they depend on K) or informal. The true statement "K is non-empty" is outside K forever because K is not a formal set. Paul Cohen proved in 1963 that the equality 2^{\aleph_0}=\aleph_1 is independent of ZFC. Before 1963, the statement "There is a known constructively defined integer n⩾1 such that 2^{\aleph_0}=\aleph_n" was outside K. Since 1963, this statement is outside K forever. The true statement "There exists a set X⊆{1,...,49} such that card(X)=6 and X never occurred as the winning six numbers in the Polish Lotto lottery" refers to the current non-mathematical knowledge and is outside K forever. In Martin-Löf's terminology, every currently known theorem is actually true whereas every theorem (known or unknown) is potentially true. Actual truth is knowledge dependent and tensed. Potential truth is knowledge independent and tenseless. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivially true statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. For every such statement, its truth concerning the current mathematical knowledge is implied by a true statement of the form: (the conjunction of i conditions of the form α∈K)∧(the conjunction of j conditions of the form β∉K)∧(the conjunction of k conditions of the form γ∈K_c)∧(the conjunction of l conditions of the form δ∉K_c), where i,j,k,l∈N and α,β,γ,δ are mathematical statements. In constructive mathematics and the traditional Brouwerian intuitionism, the truth of a mathematical statement means that we know a constructive proof. Therefore, the truth of a mathematical statement depends on time, where the statement is formally stated in the classical mathematics without the predicate K. In this article, mathematical statements on decidable sets X⊆N refer to time because they refer to the current mathematical knowledge on X. They cannot be formally stated in the classical mathematics without the predicate K and their logical values may change in time. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(X)=ω" is outside K. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove the assumption of the above statement. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. We prove that there exists a naturally defined set C⊆N which satisfies the following conditions (6)-(11). (6) A known and simple algorithm for every k∈N decides whether or not k∈C. (7) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(C)=ω" is outside K. (8) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(N\C)=ω" is outside K. (9) It is conjectured, though so far unproven, that C is infinite. (10) For every known algorithm A with no input, the statement "A returns an integer n satisfying card(C)<ω ⇒ C⊆(-∞,n]" is outside K. (11) For every known algorithm A with no input, the statement "A returns an integer m satisfying card(N\C)<ω ⇒ N\C⊆(-∞,m]" is outside K. The set C={k∈N: 2^{2^k}+1 is composite} is naturally defined and satisfies conditions (6)-(11). (shrink)

This paper develops a semantic solution to the puzzle of Free Choice permission. The paper begins with a battery of impossibility results showing that Free Choice is in tension with a variety of classical principles, including Disjunction Introduction and the Law of Excluded Middle. Most interestingly, Free Choice appears incompatible with a principle concerning the behavior of Free Choice under negation, Double Prohibition, which says that Mary can’t have soup or salad implies Mary can’t have soup and Mary can’t (...) have salad. Alonso-Ovalle 2006 and others have appealed to Double Prohibition to motivate pragmatic accounts of Free Choice. Aher 2012, Aloni 2018, and others have developed semantic accounts of Free Choice that also explain Double Prohibition. -/- This paper offers a new semantic analysis of Free Choice designed to handle the full range of impossibility results involved in Free Choice. The paper develops the hypothesis that Free Choice is a homogeneity effect. The claim possibly A or B is defined only when A and B are homogenous with respect to their modal status, either both possible or both impossible. Paired with a notion of entailment that is sensitive to definedness conditions, this theory validates Free Choice while retaining a wide variety of classical principles except for the transitivity of entailment. The homogeneity hypothesis is implemented in two different ways, homogeneous alternative semantics and homogeneous dynamic semantics, with interestingly different consequences. (shrink)

Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. We show that the former is the image of a surjective homomorphism from the latter, i.e., an epimorphic image. The epimorphism was found with the help of MUltlog, which also provides a tableau calculus for NC extended by quantifiers that generalize conjunction and disjunction.

This paper proposes a semantics for free choice permission that explains both the non-classical behavior of modals and disjunction in sentences used to grant permission, and their classical behavior under negation. It also explains why permissions can expire when new information comes in and why free choice arises even when modals scope under disjunction. On the proposed approach, deontic modals update preference orderings, and connectives operate on these updates rather than propositions. The success of this approach stems from (...) its capacity to capture the difference between expressing the preferences that give rise to permissions and conveying propositions about those preferences. (shrink)

Various philosophers have long since been attracted to the doctrine that future contingent propositions systematically fail to be true—what is sometimes called the doctrine of the open future. However, open futurists have always struggled to articulate how their view interacts with standard principles of classical logic—most notably, with the Law of Excluded Middle. For consider the following two claims: Trump will be impeached tomorrow; Trump will not be impeached tomorrow. According to the kind of open futurist at issue, both of (...) these claims may well fail to be true. According to many, however, the disjunction of these claims can be represented as p ∨ ~p—that is, as an instance of LEM. In this essay, however, I wish to defend the view that the disjunction these claims cannot be represented as an instance of p ∨ ~p. And this is for the following reason: the latter claim is not, in fact, the strict negation of the former. More particularly, there is an important semantic distinction between the strict negation of the first claim [~] and the latter claim. However, the viability of this approach has been denied by Thomason, and more recently by MacFarlane and Cariani and Santorio, the latter of whom call the denial of the given semantic distinction “scopelessness”. According to these authors, that is, will is “scopeless” with respect to negation; whereas there is perhaps a syntactic distinction between ‘~Will p’ and ‘Will ~p’, there is no corresponding semantic distinction. And if this is so, the approach in question fails. In this paper, then, I criticize the claim that will is “scopeless” with respect to negation. I argue that will is a so-called “neg-raising” predicate—and that, in this light, we can see that the requisite scope distinctions aren’t missing, but are simply being masked. The result: a under-appreciated solution to the problem of future contingents that sees and as contraries, not contradictories. (shrink)

The Proviso Problem is the discrepancy between the predictions of nearly every major theory of semantic presupposition about what is semantically presupposed by conditionals, disjunctions, and conjunctions, versus observations about what speakers of certain sentences are felt to be presupposing. I argue that the Proviso Problem is a more serious problem than has been widely recognized. After briefly describing the problem and two standard responses to it, I give a number of examples which, I argue, show that those responses are (...) inadequate. I conclude by briefly exploring alternate approaches to presupposition that avoid this problem. -/- . (shrink)