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)

A work on the philosophy of mathematics (2017) -/- ‘Number’, such a simple idea, and yet it fascinated and absorbed the greatest proportion of human geniuses over centuries, not to mention the likes of Pythagoras, Euclid, Newton, Leibniz, Descartes and countless maths giants like Euler, Gauss and Hilbert, etc.. Einstein thought of pure maths as the poetry of logical ideas, the exactitude of which, although independent of experience, strangely seems to benefit the study of the objects of reality. And, interestingly (...) as well as surprisingly we are nowhere near any clear understandings of numbers despite discoveries of many productive usages of numbers. This is - rightly or wrongly - a humble attempt to approach the subject from an angle hitherto unthought-of. (shrink)

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)

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.

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)

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.

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)

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)

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)

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)

(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.

Achieving space situational awareness requires, at a minimum, the identification, characterization, and tracking of space objects. Leveraging the resultant space object data for purposes such as hostile threat assessment, object identification, and conjunction assessment presents major challenges. This is in part because in characterizing space objects we reference a variety of identifiers, components, subsystems, capabilities, vulnerabilities, origins, missions, orbital elements, patterns of life, operational processes, operational statuses, and so forth, which tend to be defined in highly (...) heterogeneous and sometimes inconsistent ways. The Space Domain Ontologies are designed to provide a consensus-based realist framework for formulating such characterizations in a way that is both consistent and computable. Space object data are aligned with classes and relations in a suite of ontologies built around the existing Space Object Ontology. They are stored in a dynamically updated Resource Description Framework triple store, which can be queried to support space situational awareness and the needs of spacecraft operators and analysts. This paper provides an overview of the Space Domain Ontologies and their development and use. It presents the motivation for and advantages of the Space Domain Ontologies, including the benefits they provide for enhancing and maintaining long-term space situational awareness. (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)

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)

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)

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)

This paper presents a dilemma for the additive model of reasons. Either the model accommodates disjunctive cases in which one ought to perform some act $$\phi $$ just in case at least one of two factors obtains, or it accommodates conjunctive cases in which one ought to $$\phi $$ just in case both of two factors obtains. The dilemma also arises in a revised additive model that accommodates imprecisely weighted reasons. There exist disjunctive and conjunctive cases. (...) Hence the additive model is extensionally inadequate. The upshot of the dilemma is that one of the most influential accounts of how reasons accrue to determine what we ought to do is flawed. (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)

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)

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)

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)

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)

A-theoretic presentness is commonly regarded as non-solipsist and non-relative. The non-solipsism of a non-relative, A-theoretic presentness requires at least two space-like separated things to be present simpliciter together – this co-presentness further implies the global, non-relative, non-conventional simultaneity of them. Yet, this implication clashes with the general view that there is no global, non-relative, non-conventional simultaneity in Minkowski space-time. In order to resolve this conflict, this paper explores the possibility that the non-solipsism of a non-relative, A-theoretic presentness does (...) not require at least two space-like separated things to be present simpliciter together. This can be done by holding exclusive disjunctivism –that mutually space-like separated things are present simpliciter exclusively disjunctively, and each one of them gets to be present simpliciter in a non-successive way (just like mutually time-like related things are present simpliciter exclusively disjunctively, and each one of them gets to be present simpliciter, but in a successive way). (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)

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 essay examines the relationship between monads and space in Kant’s early pre-critical work, with special attention devoted to the question of ubeity, a Scholastic doctrine that Leibniz describes as “ways of being somewhere”. By focusing attention on this concept, evidence will be put forward that supports the claim, held by various scholars, that the monad-space relationship in Kant is closer to Leibniz’ original conception than the hypotheses typically offered by the later Leibniz-Wolff school. In addition, Kant’s monadology, (...) in conjunction with God’s role, also helps to shed light on further aspects of his system that are broadly Leibnizian, such as monadic activity and the unity of space. (shrink)

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)

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)

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)

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)

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.

Is the mathematical function being computed by a given physical system determined by the system’s dynamics? This question is at the heart of the indeterminacy of computation phenomenon (Fresco et al. [unpublished]). A paradigmatic example is a conventional electrical AND-gate that is often said to compute conjunction, but it can just as well be used to compute disjunction. Despite the pervasiveness of this phenomenon in physical computational systems, it has been discussed in the philosophical literature only indirectly, mostly with reference (...) to the debate over realism about physical computation and computationalism. A welcome exception is Dewhurst’s ([2018]) recent analysis of computational individuation under the mechanistic framework. He rejects the idea of appealing to semantic properties for determining the computational identity of a physical system. But Dewhurst seems to be too quick to pay the price of giving up the notion of computational equivalence. We aim to show that the mechanist need not pay this price. The mechanistic framework can, in principle, preserve the idea of computational equivalence even between two different enough kinds of physical systems, say, electrical and hydraulic ones. (shrink)

This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...) on conjunction and disjunction in the weak Kleene logics accompany this paper, particularly concerning their relation with containment logics. These considerations motivate a special approach to defining sound and complete Gentzen-style sequent calculi for some of their four-valued generalizations. (shrink)

I make the observation that English sentences such as “You have reason to take the bus or to take the train” do not have the logical form that they superficially appear to have. I find in these sentences a conjunctive use of “or,” as found in sentences like “You can have milk or lemon in your tea,” which gives you a permission to have milk, and a permission to have lemon, though no permission to have both. I argue that (...) a confusion of genuine disjunctions with sentences of the above form has motivated the mistaken acceptance by some philosophers of principles like the one I call “Liberal Transmission.” This is the principle that if you have a reason to do something, then you have a reason to do it in each of the possible ways in which it can be done (though not more than one of them). I argue that Liberal Transmission and its close relatives are false. Wide-scope reasons are defined as reasons that have a conditional or other logical connective within the scope of the reason operator. For example, a wide-scope instrumental reason might be: reason(if you have an end, take the means). By refuting Liberal Transmission, I show that you could have wide-scope instrumental reasons like this while nevertheless lacking any narrow-scope reason to take the means, or narrow-scope reason to not have the end. This enables me to respond to two major objections to the wide-scope approach to the instrumental principle that have been developed by Joseph Raz and by Niko Kolodny. (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.

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)

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)

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)

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)

In many languages, the same particles that form quantifier words also serve as connectives, additive and scalar particles, question markers, roots of existential verbs, and so on. Do these have a unified semantics, or do they merely bear a family resemblance? Are they aided by silent operators in their varied roles―if yes, what operators? I dub the particles “quantifier particles” and refer to them generically with capitalized versions of the Japanese morphemes. I argue that both MO and KA can be (...) assigned a stable semantics across their various roles. The specific analysis I offer is motivated by the fact that MO and KA often combine with just one argument; I propose that this is their characteristic behavior. Their role is to impose semantic requirements that are satisfied when the immediately larger context is interpreted as the meet/join of their host’s semantic contribution with something else. They do not perform meet/join themselves. The obligatory vs. optional appearance of the particles depends on whether the meet/join interpretations arise by default in the given constellation. I explicate the proposal using the toolkit of basic Inquisitive Semantics. (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)

Many countries throughout the globe function in a system that allows the usage of more than one language. Such a multilingual social reality’s construction, especially in societies like the one in which I am living, is perceived in many different ways: attempting thus to provide for the process of differentiating identity’s oneness and sameness into various cultural subcategories, which already represent new realities. Due to newly created social realities, semiotics naturally discusses the differences and/or oppositions that can contribute to various (...) cultures’ mutual exclusivity or inclusivity, in terms of various heterogeneous “transformations,” which would thus overcome dualities, and be viewed as single acts of signs, or as a result of a process of singularization of their constituent components. I shall also attempt using a semiotic style that may enact a semiotics of action, grounded on the semiotics of passions, through a way of producing semantic taxonomies as pride versus humiliation, hegemony versus subordination, etc., obtainable due to disjunctive and/or conjunctive semiotic relations such as contextualization versus de-contextualization. (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).

The infinitary function of the truth predicate consists in its ability to express infinite conjunctions and disjunctions. A transparency principle for truth states the equivalence between a sentence and its truth predication; it requires an introduction principle—which allows the inference from “snow is white” to “the sentence ‘snow is white’ is true”—and an elimination principle—which allows the inference from “the sentence ‘snow is white’ is true” to “snow is white”. It is commonly assumed that a theory of truth needs to (...) satisfy a transparency principle to fulfil the infinitary function. Picollo and Schindler (Erkenntnis 83:899–928, 2017) argue against this idea. They prove that, given certain assumptions, an elimination principle is sufficient for the purpose. Then, they pose a challenge: to show why we should incorporate introduction principles to our theory of truth. In this essay I take on the challenge. I show that, given the authors’ assumptions, an introduction principle is also sufficient to perform the infinitary function. (shrink)

This paper argues for the following disjunction: either we do not live in a world with a branching temporal structure, or backwards time travel is nomologically impossible, given the initial state of the universe, or backwards time travel to our space-time location is impossible given large-scale facts about space and time. A fortiori, if backwards time travel to our location is possible, we do not live in a branching universe.

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.

The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to "0", individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.

Future Logic is an original, and wide-ranging treatise of formal logic. It deals with deduction and induction, of categorical and conditional propositions, involving the natural, temporal, extensional, and logical modalities. Traditional and Modern logic have covered in detail only formal deduction from actual categoricals, or from logical conditionals (conjunctives, hypotheticals, and disjunctives). Deduction from modal categoricals has also been considered, though very vaguely and roughly; whereas deduction from natural, temporal and extensional forms of conditioning has been all but totally ignored. (...) As for induction, apart from the elucidation of adductive processes (the scientific method), almost no formal work has been done. This is the first work ever to strictly formalize the inductive processes of generalization and particularization, through the novel methods of factorial analysis, factor selection and formula revision. This is the first work ever to develop a formal logic of the natural, temporal and extensional types of conditioning (as distinct from logical conditioning), including their production from modal categorical premises. Future Logic contains a great many other new discoveries, organized into a unified, consistent and empirical system, with precise definitions of the various categories and types of modality (including logical modality), and full awareness of the epistemological and ontological issues involved. Though strictly formal, it uses ordinary language, wherever symbols can be avoided. Among its other contributions: a full list of the valid modal syllogisms (which is more restrictive than previous lists); the main formalities of the logic of change (which introduces a dynamic instead of merely static approach to classification); the first formal definitions of the modal types of causality; a new theory of class logic, free of the Russell Paradox; as well as a critical review of modern metalogic. But it is impossible to list briefly all the innovations in logical science — and therefore, epistemology and ontology — this book presents; it has to be read for its scope to be appreciated. (shrink)