Results for 'Simplification of disjunctive antecedents'

999 found
Order:
  1. Disjunctive antecedent conditionals.Justin Khoo - 2018 - Synthese 198 (8):7401-7430.
    Disjunctive antecedent conditionals —conditionals of the form if A or B, C—sometimes seem to entail both of their simplifications and sometimes seem not to. I argue that this behavior reveals a genuine ambiguity in DACs. Along the way, I discuss a new observation about the role of focal stress in distinguishing the two interpretations of DACs. I propose a new theory, according to which the surface form of a DAC underdetermines its logical form: on one possible logical form, if (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  2.  24
    Free choice, simplification, and Innocent Inclusion.Moshe E. Bar-Lev & Danny Fox - 2020 - Natural Language Semantics 28 (3):175-223.
    We propose a modification of the exhaustivity operator from Fox Presupposition and implicature in compositional semantics, Palgrave Macmillan, London, pp 71–120, 2007. https://doi.org/10.1057/9780230210752_4) that on top of negating all the Innocently Excludable alternatives affirms all the ‘Innocently Includable’ ones. The main result of supplementing the notion of Innocent Exclusion with that of Innocent Inclusion is that it allows the exhaustivity operator to identify cells in the partition induced by the set of alternatives whenever possible. We argue for this property of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  3. Amer. Math. Soc. Tnnil.A. Simplification of A. Selberg'S. Elementary & of Distribution of Prime Numbers - 1979 - In A. F. Lavrik (ed.), Twelve Papers in Logic and Algebra. American Mathematical Society. pp. 75.
    No categories
     
    Export citation  
     
    Bookmark  
  4. On the Substitution of Identicals in Counterfactual Reasoning.Alexander W. Kocurek - 2020 - Noûs 54 (3):600-631.
    It is widely held that counterfactuals, unlike attitude ascriptions, preserve the referential transparency of their constituents, i.e., that counterfactuals validate the substitution of identicals when their constituents do. The only putative counterexamples in the literature come from counterpossibles, i.e., counterfactuals with impossible antecedents. Advocates of counterpossibilism, i.e., the view that counterpossibles are not all vacuous, argue that counterpossibles can generate referential opacity. But in order to explain why most substitution inferences into counterfactuals seem valid, counterpossibilists also often maintain that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  33
    Simplification and substitution of counterfactual antecedents.Donald Nute - 1978 - Philosophia 7 (2):317-325.
  6. Counterfactuals with disjunctive antecedents.Barry Loewer - 1976 - Journal of Philosophy 73 (16):531-537.
  7. Interventionist counterfactuals.Rachael Briggs - 2012 - Philosophical Studies 160 (1):139-166.
    A number of recent authors (Galles and Pearl, Found Sci 3 (1):151–182, 1998; Hiddleston, Noûs 39 (4):232–257, 2005; Halpern, J Artif Intell Res 12:317–337, 2000) advocate a causal modeling semantics for counterfactuals. But the precise logical significance of the causal modeling semantics remains murky. Particularly important, yet particularly under-explored, is its relationship to the similarity-based semantics for counterfactuals developed by Lewis (Counterfactuals. Harvard University Press, 1973b). The causal modeling semantics is both an account of the truth conditions of counterfactuals, and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   94 citations  
  8. Marfa-Luisa Rivero.Antecedents of Contemporary Logical & Linguistic Analyses in Scholastic Logic - 1973 - Foundations of Language 10:55.
    No categories
     
    Export citation  
     
    Bookmark  
  9. Alternatives and Truthmakers in Conditional Semantics.Paolo Santorio - 2018 - Journal of Philosophy 115 (10):513-549.
    Natural language conditionals seem to be subject to three logical requirements: they invalidate Antecedent Strengthening, they validate so-called Simplification of Disjunctive Antecedents, and they allow for the replacement of logically equivalent clauses in antecedent position. Unfortunately, these requirements are jointly inconsistent. Conservative solutions to the puzzle drop Simplification, treating it as a pragmatic inference. I show that pragmatic accounts of Simplification fail, and develop a truthmaker semantics for conditionals that captures all the relevant data. Differently (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  10.  89
    Simplifying with Free Choice.Malte Willer - 2018 - Topoi 37 (3):379-392.
    This paper offers a unified semantic explanation of two observations that prove to be problematic for classical analyses of modals, conditionals, and disjunctions: the fact that disjunctions scoping under possibility modals give rise to the free choice effect and the fact that counterfactuals license simplification of disjunctive antecedents. It shows that the data are well explained by a dynamic semantic analysis of modals and conditionals that uses ideas from the inquisitive semantic tradition in its treatment of disjunction. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  11. Conditional Heresies.Fabrizio Cariani & Simon Goldstein - 2018 - Philosophy and Phenomenological Research (2):251-282.
  12. Causal Modeling Semantics for Counterfactuals with Disjunctive Antecedents.Giuliano Rosella & Jan Sprenger - manuscript
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13. Counterfactual donkeys don't get high.Michael Deigan - 2018 - Proceedings of Sinn Und Bedeutung 22 1:367--384.
    I present data that suggest the universal entailments of counterfactual donkey sentences aren’t as universal as some have claimed. I argue that this favors the strategy of attributing these entailments to a special property of the similarity ordering on worlds provided by some contexts, rather than to a semantically encoded sensitivity to assignment.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  38
    Causal modeling semantics for counterfactuals with disjunctive antecedents.Giuliano Rosella & Jan Sprenger - forthcoming - Annals of Pure and Applied Logic.
  15. Or Issues in the Semantics and Pragmatics of Disjunction.Mandy Simons - 1998 - Dissertation, Cornell University
    Grice observes that the primary discourse function of disjunction is the presentation of alternatives, each of which is relevant in the same way to a given topic. After a brief introduction , I offer in Chapter Two an account of Grice's observation and of further felicity conditions on disjunction, for example, the constraint against disjunctions in which one disjunct entails another. Using an enriched version of the Stalnakerian model of assertion, I define two constraints on information update--Relevant Informativity and Simplicity--and (...)
     
    Export citation  
     
    Bookmark   14 citations  
  16.  10
    On Simplification Algorithms for Disjunctive Normal Forms.E. Mendelson - 1966 - Journal of Symbolic Logic 31 (1):141-141.
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  37
    The Implicative Conditional.Eric Raidl & Gilberto Gomes - 2023 - Journal of Philosophical Logic 53 (1):1-47.
    This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. $${p\Rightarrow q}$$ p ⇒ q is thus defined as $${\lnot } \Diamond {(p \wedge \lnot q) \wedge } \Diamond {p \wedge } \Diamond {\lnot q}$$ ¬ ◊ (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  21
    Review: F.I. Andon, Ob odnom podhode k minimizacii sistem buleoyh funkcij (On One Approach to the Minimization of Systems of Boolean Functions); F. I. Andon, Algoritm uproscenia d.n.f. bulevyh funckij (A Simplification Alogorithm of a Disjunctive Normal Form of the Boolean Functions). [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (2):330-330.
  19.  28
    Ú. I. Žuravlév. Ob algoritmahj uproščéniá dizúnktivnyh normal′nyh form. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 260–263. - Yu. I. Žuravlev. On simplification algorithms for disjunctive normal forms. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 526–529. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20. Counterfactuals, correlatives, and disjunction.Luis Alonso-Ovalle - 2009 - Linguistics and Philosophy 32 (2):207-244.
    The natural interpretation of counterfactuals with disjunctive antecedents involves selecting from each of the disjuncts the worlds that come closest to the world of evaluation. It has been long noticed that capturing this interpretation poses a problem for a minimal change semantics for counterfactuals, because selecting the closest worlds from each disjunct requires accessing the denotation of the disjuncts from the denotation of the disjunctive antecedent, which the standard boolean analysis of or does not allow (Creary and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  21. Breaking de Morgan's law in counterfactual antecedents.Lucas Champollion, Ivano Ciardelli & Linmin Zhang - manuscript
    The main goal of this paper is to investigate the relation between the meaning of a sentence and its truth conditions. We report on a comprehension experiment on counterfactual conditionals, based on a context in which a light is controlled by two switches. Our main finding is that the truth-conditionally equivalent clauses (i) "switch A or switch B is down" and (ii) "switch A and switch B are not both up" make different semantic contributions when embedded in a conditional antecedent. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  22. Review: Yu. I. Zuravlev, E. Mendelson, On Simplification Algorithms for Disjunctive Normal Forms. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
  23. Linguistic-pragmatic factors in interpreting disjunctions.Ira A. Noveck, Gennaro Chierchia, Florelle Chevaux, Raphaelle Guelminger & Emmanuel Sylvestre - 2002 - Thinking and Reasoning 8 (4):297 – 326.
    The connective or can be treated as an inclusive disjunction or else as an exclusive disjunction. Although researchers are aware of this distinction, few have examined the conditions under which each interpretation should be anticipated. Based on linguistic-pragmatic analyses, we assume that interpretations are initially inclusive before either (a) remaining so, or (b) becoming exclusive by way of an implicature ( but not both ). We point to a class of situations that ought to predispose disjunctions to inclusive interpretations and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  24. A Uniform Theory of Conditionals.William B. Starr - 2014 - Journal of Philosophical Logic 43 (6):1019-1064.
    A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   59 citations  
  25.  78
    Counterfactuals with Disjunctive Antecedents.Thomas Mckay & Peter Van Inwagen - 1977 - Philosophical Studies 31 (5):353 - 356.
  26.  6
    The Social Character of Literature: Adorno The Legacy of the Aesthetics of German Idealism.Mario Farina - 2022 - Rivista di Estetica 81:106-121.
    The aim of this paper is to investigate the function of the aesthetic paradigm of German idealism within Adorno’s thought. In order to do so, I have chosen to focus on the issue of the social significance of the work of art and the role played by the concept of literary material. Adorno’s aesthetics, in fact, can be read as a reinterpretation of the idealist aesthetic model based precisely on a non-idealist notion such as that of aesthetic material.If one is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. Two switches in the theory of counterfactuals: A study of truth conditionality and minimal change.Ivano Ciardelli, Linmin Zhang & Lucas Champollion - 2018 - Linguistics and Philosophy (6).
    Based on a crowdsourced truth value judgment experiment, we provide empirical evidence challenging two classical views in semantics, and we develop a novel account of counterfactuals that combines ideas from inquisitive semantics and causal reasoning. First, we show that two truth-conditionally equivalent clauses can make different semantic contributions when embedded in a counterfactual antecedent. Assuming compositionality, this means that the meaning of these clauses is not fully determined by their truth conditions. This finding has a clear explanation in inquisitive semantics: (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  28.  2
    Tractatus Syncategorematum and Selected Anonymous Treatises.Peter of Spain - 1964 - Milwaukee, WI, USA: Marquette University Press.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  24
    The Syntax of Principles: Genericity as a Logical Distinction between Rules and Principles.Pedro Moniz Lopes - 2017 - Ratio Juris 30 (4):471-490.
    Much has been said about the logical difference between rules and principles, yet few authors have focused on the distinct logical connectives linking the normative conditions of both norms. I intend to demonstrate that principles, unlike rules, are norms whose antecedents are linguistically formulated in a generic fashion, and thus logically described as inclusive disjunctions. This core feature incorporates the relevance criteria of normative antecedents into the world of principles and also explains their aptitude to conflict with opposing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  57
    A simplification of the logic of conditionals.E. J. Lowe - 1983 - Notre Dame Journal of Formal Logic 24 (3):357-366.
  31.  33
    Changes of disjunctively closed bases.Sven Ove Hansson - 1993 - Journal of Logic, Language and Information 2 (4):255-284.
    An operator of contraction for a belief set (a theory) can be obtained by assigning to it a belief base and an operator of partial meet contraction for that base. It is argued that closure of the base under disjunction is an intuitively reasonable condition. Axiomatic characterizations are given of the contractions of belief sets that can be generated by (various types of) partial meet contraction on disjunctively closed bases. The corresponding revision operators are also characterized. Finally, some results are (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  32.  2
    Automated Simplification of Large Symbolic Expressions.David Bailey, Borwein H., M. Jonathan & Alexander D. Kaiser - 2014 - Journal of Symbolic Computation 60:120–136.
    We present a set of algorithms for automated simplification of symbolic constants of the form ∑iαixi with αi rational and xi complex. The included algorithms, called SimplifySum2 and implemented in Mathematica, remove redundant terms, attempt to make terms and the full expression real, and remove terms using repeated application of the multipair PSLQ integer relation detection algorithm. Also included are facilities for making substitutions according to user-specified identities. We illustrate this toolset by giving some real-world examples of its usage, (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  21
    Simplifications of the recursion scheme.M. D. Gladstone - 1971 - Journal of Symbolic Logic 36 (4):653-665.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34.  77
    A simplification of the theory of simplicity.Samuel A. Richmond - 1996 - Synthese 107 (3):373 - 393.
    Nelson Goodman has constructed two theories of simplicity: one of predicates; one of hypotheses. I offer a simpler theory by generalization and abstraction from his. Generalization comes by dropping special conditions Goodman imposes on which unexcluded extensions count as complicating and which excluded extensions count as simplifying. Abstraction is achieved by counting only nonisomorphic models and subinterpretations. The new theory takes into account all the hypotheses of a theory in assessing its complexity, whether they were projected prior to, or result (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35.  39
    A simplification of a completeness proof of Guaspari and Solovay.Dick H. J. Jongh - 1987 - Studia Logica 46 (2):187 - 192.
    The modal completeness proofs of Guaspari and Solovay (1979) for their systems R and R – are improved and the relationship between R and R – is clarified.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  36.  31
    A simplification of the Bachmann method for generating large countable ordinals.Jane Bridge - 1975 - Journal of Symbolic Logic 40 (2):171-185.
  37.  10
    A Simplification of the Completeness Proofs for Guaspari and Solovay's R.Frans Voorbraak - 1989 - Notre Dame Journal of Formal Logic 31 (1):44-63.
  38.  19
    Generalisation of disjunctive sequences.Cristian S. Calude - 2005 - Mathematical Logic Quarterly 51 (2):120.
    The present paper proposes a generalisation of the notion of disjunctive sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F. We show that a definition like “every subword which occurs at infinitely many different positions in sequences in F has to occur infinitely often in the sequence” fulfils properties similar to the original unrelativised notion (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  26
    A simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$.Frans Voorbraak - 1989 - Notre Dame Journal of Formal Logic 31 (1):44-63.
  40.  4
    The Simplification of Life: From the Writings of E. Carpenter Selected by H. Roberts.Edward Carpenter & Harry Roberts - 1905
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  26
    A simplification of combinatory logic.Nicolas D. Goodman - 1972 - Journal of Symbolic Logic 37 (2):225-246.
  42.  26
    Analogy of Disjunction.Domenic D’Ettore - 2020 - Studia Neoaristotelica 17 (1):7-33.
    At the beginning of his influential De Nominum Analogia, Thomas de Vio Cajetan mentions three mistaken positions on analogy. He does not attach names to these positions, but each one was held by distinguished Thomists of the fourteenth and fifteenth centuries. Furthermore, their proponents were responding to the same set of challenges from John Duns Scotus that set the agenda for the De Nominum Analogia. In this paper, I would like to do something that Cajetan did not do, and that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43.  7
    Simplification of system F.John G. Gill - 1971 - Mind 80 (318):276-277.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  44.  28
    A simplification of the basic theorem on automata.Jerzy Nowak - 1970 - Studia Logica 26 (1):35 - 44.
  45.  17
    A simplification of basic logic.Frederic B. Fitch - 1953 - Journal of Symbolic Logic 18 (4):317-325.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  52
    Algebraic simplification of redundant sequential circuits.Frederic B. Fitch - 1963 - Synthese 15 (1):155 - 166.
  47.  6
    A Simplification of Basic Logic.Frederic B. Fitch - 1955 - Journal of Symbolic Logic 20 (1):81-81.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  4
    Algebraic Simplification of Redundant Sequential Circuits.Frederic B. Fitch - 1975 - Journal of Symbolic Logic 40 (4):615-615.
    Direct download  
     
    Export citation  
     
    Bookmark  
  49. Acquisition of Disjunction in Conditional Sentences.Andrea Gualmini - unknown
    This study is concerned with the properties of the disjunction operator, or, and the acquisition of these properties by English-speaking children. Previous research has concluded that adult truth conditions for logical connectives are acquired relatively late in the course of language development. With particular reference to disjunction, the results of several studies have led to two claims. First, it has been argued that the full range of truth-conditions associated with inclusive-or is not initially available to children; instead, children are supposed (...)
     
    Export citation  
     
    Bookmark   1 citation  
  50.  14
    A simplification of Lewis and Langford's postulates for Boolean algebra.Edward V. Huntington - 1933 - Mind 42 (166):203-207.
1 — 50 / 999