59 found
Order:
Disambiguations
Wesley H. Holliday [58]Wesley Holliday [8]
  1.  56
    (1 other version)The Orthologic of Epistemic Modals.Wesley H. Holliday & Matthew Mandelkern - 2024 - Journal of Philosophical Logic 53 (4):831-907.
    Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $$p\wedge \Diamond \lnot p$$ (‘p, but it might be that not p’) appears to be a contradiction, $$\Diamond \lnot p$$ does not entail $$\lnot p$$, which would follow in classical logic. Likewise, the classical laws of distributivity and disjunctive syllogism fail for epistemic modals. Existing attempts to account for these facts generally either under- or over-correct. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2. Epistemic Closure and Epistemic Logic I: Relevant Alternatives and Subjunctivism.Wesley H. Holliday - 2015 - Journal of Philosophical Logic 44 (1):1-62.
    Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having “competently deduced” it from the known propositions). In this sense, the claim that epistemic closure can fail must be distinguished from the fact that agents do (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  3. Possibility Semantics.Wesley H. Holliday - 2021 - In Melvin Fitting (ed.), Selected Topics From Contemporary Logics. College Publications. pp. 363-476.
    In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a set can be viewed as a "possible world," with the key property of a world being primeness—a world makes a disjunction true only if it makes one of the disjuncts true—which classically implies totality—for each proposition, a world either (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  4. Moorean Phenomena in Epistemic Logic.Wesley H. Holliday & Thomas F. Icard - 2010 - In Lev Dmitrievich Beklemishev, Valentin Goranko & Valentin Shehtman (eds.), Advances in Modal Logic 8. London, England: College Publications. pp. 178-199.
    A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  5.  79
    A Semantic Hierarchy for Intuitionistic Logic.Guram Bezhanishvili & Wesley H. Holliday - 2019 - Indagationes Mathematicae 30 (3):403-469.
    Brouwer's views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke (...)
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  6. Fallibilism and Multiple Paths to Knowledge.Wesley H. Holliday - 2015 - Oxford Studies in Epistemology 5:97-144.
    This chapter argues that epistemologists should replace a “standard alternatives” picture of knowledge, assumed by many fallibilist theories of knowledge, with a new “multipath” picture of knowledge. The chapter first identifies a problem for the standard picture: fallibilists working with this picture cannot maintain even the most uncontroversial epistemic closure principles without making extreme assumptions about the ability of humans to know empirical truths without empirical investigation. The chapter then shows how the multipath picture, motivated by independent arguments, saves fallibilism (...)
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  7.  98
    A fundamental non-classical logic.Wesley Holliday - 2023 - Logics 1 (1):36-79.
    We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in the given signature; (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. Measure Semantics and Qualitative Semantics for Epistemic Modals.Wesley H. Holliday & Thomas F. Icard - 2013 - Proceedings of SALT 23:514-534.
    In this paper, we explore semantics for comparative epistemic modals that avoid the entailment problems shown to result from Kratzer’s (1991) semantics by Yalcin (2006, 2009, 2010). In contrast to the alternative semantics presented by Yalcin and Lassiter (2010, 2011), based on finitely additive probability measures, we introduce semantics based on qualitatively additive measures, as well as semantics based on purely qualitative orderings, including orderings on propositions derived from orderings on worlds in the tradition of Kratzer (1991). All of these (...)
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  9. Choice-free stone duality.Nick Bezhanishvili & Wesley H. Holliday - 2020 - Journal of Symbolic Logic 85 (1):109-148.
    The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10. Roles, Rigidity and Quantification in Epistemic Logic.Wesley H. Holliday & John Perry - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 591-629.
    Epistemic modal predicate logic raises conceptual problems not faced in the case of alethic modal predicate logic : Frege’s “Hesperus-Phosphorus” problem—how to make sense of ascribing to agents ignorance of necessarily true identity statements—and the related “Hintikka-Kripke” problem—how to set up a logical system combining epistemic and alethic modalities, as well as others problems, such as Quine’s “Double Vision” problem and problems of self-knowledge. In this paper, we lay out a philosophical approach to epistemic predicate logic, implemented formally in Melvin (...)
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  11. Freedom and the Fixity of the Past.Wesley H. Holliday - 2012 - Philosophical Review 121 (2):179-207.
    According to the Principle of the Fixity of the Past (FP), no one can now do anything that would require the past to have unfolded differently than it actually did, for the past is fixed, over and done with. Why might doing something in the future require the past to be different? Because if determinism is true—if the laws of nature and the initial conditions of the Big Bang determined a unique future for our universe—then doing anything other than what (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  12.  57
    A bimodal perspective on possibility semantics.Johan van Benthem, Nick Bezhanishvili & Wesley H. Holliday - 2017 - Journal of Logic and Computation 27 (5):1353–1389.
    In this article, we develop a bimodal perspective on possibility semantics, a framework allowing partiality of states that provides an alternative modelling for classical propositional and modal logics. In particular, we define a full and faithful translation of the basic modal logic K over possibility models into a bimodal logic of partial functions over partial orders, and we show how to modulate this analysis by varying across logics and model classes that have independent topological motivations. This relates the two realms (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  13.  64
    Complete additivity and modal incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
    In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  14. Information dynamics and uniform substitution.Wesley H. Holliday, Tomohiro Hoshi & Thomas F. Icard Iii - 2013 - Synthese 190 (1):31-55.
    The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  15. A note on cancellation axioms for comparative probability.Matthew Harrison-Trainor, Wesley H. Holliday & Thomas F. Icard - 2016 - Theory and Decision 80 (1):159-166.
    We prove that the generalized cancellation axiom for incomplete comparative probability relations introduced by Rios Insua and Alon and Lehrer is stronger than the standard cancellation axiom for complete comparative probability relations introduced by Scott, relative to their other axioms for comparative probability in both the finite and infinite cases. This result has been suggested but not proved in the previous literature.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  16. Compatibility, compossibility, and epistemic modality.Wesley Holliday & Matthew Mandelkern - forthcoming - Proceedings of the 23rd Amsterdam Colloquium.
    We give a theory of epistemic modals in the framework of possibility semantics and axiomatize the corresponding logic, arguing that it aptly characterizes the ways in which reasoning with epistemic modals does, and does not, diverge from classical modal logic.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  68
    Logics of Imprecise Comparative Probability.Yifeng Ding, Wesley H. Holliday & Thomas F. Icard - 2021 - International Journal of Approximate Reasoning 132:154-180.
    This paper studies connections between two alternatives to the standard probability calculus for representing and reasoning about uncertainty: imprecise probability andcomparative probability. The goal is to identify complete logics for reasoning about uncertainty in a comparative probabilistic language whose semantics is given in terms of imprecise probability. Comparative probability operators are interpreted as quantifying over a set of probability measures. Modal and dynamic operators are added for reasoning about epistemic possibility and updating sets of probability measures.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  60
    The logic of comparative cardinality.Yifeng Ding, Matthew Harrison-Trainor & Wesley H. Holliday - 2020 - Journal of Symbolic Logic 85 (3):972-1005.
    This paper investigates the principles that one must add to Boolean algebra to capture reasoning not only about intersection, union, and complementation of sets, but also about the relative size of sets. We completely axiomatize such reasoning under the Cantorian definition of relative size in terms of injections.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  46
    One Modal Logic to Rule Them All?Wesley H. Holliday & Tadeusz Litak - 2018 - In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe & Thomas Studer (eds.), Advances in Modal Logic, Vol. 12. College Publications. pp. 367-386.
    In this paper, we introduce an extension of the modal language with what we call the global quantificational modality [∀p]. In essence, this modality combines the propositional quantifier ∀p with the global modality A: [∀p] plays the same role as the compound modality ∀pA. Unlike the propositional quantifier by itself, the global quantificational modality can be straightforwardly interpreted in any Boolean Algebra Expansion (BAE). We present a logic GQM for this language and prove that it is complete with respect to (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  20. (1 other version)Knowledge, Time, and Paradox: Introducing Sequential Epistemic Logic.Wesley Holliday - 2018 - In Hans van Ditmarsch & Gabriel Sandu (eds.), Outstanding Contributions to Logic: Jaakko Hintikka. Springer.
    Epistemic logic in the tradition of Hintikka provides, as one of its many applications, a toolkit for the precise analysis of certain epistemological problems. In recent years, dynamic epistemic logic has expanded this toolkit. Dynamic epistemic logic has been used in analyses of well-known epistemic “paradoxes”, such as the Paradox of the Surprise Examination and Fitch’s Paradox of Knowability, and related epistemic phenomena, such as what Hintikka called the “anti-performatory effect” of Moorean announcements. In this paper, we explore a variation (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  57
    On the Modal Logic of Subset and Superset: Tense Logic over Medvedev Frames.Wesley H. Holliday - 2017 - Studia Logica 105 (1):13-35.
    Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle W,R\rangle$ (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  22. Another Problem in Possible World Semantics.Yifeng Ding & Wesley H. Holliday - 2020 - In Nicola Olivetti & Rineke Verbrugge (eds.), Advances in Modal Logic, Vol. 13. College Publications. pp. 149-168.
    In "A Problem in Possible-World Semantics," David Kaplan presented a consistent and intelligible modal principle that cannot be validated by any possible world frame (in the terminology of modal logic, any neighborhood frame). However, Kaplan's problem is tempered by the fact that his principle is stated in a language with propositional quantification, so possible world semantics for the basic modal language without propositional quantifiers is not directly affected, and the fact that on careful inspection his principle does not target the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  23. A Uniform Logic of Information Dynamics.Wesley H. Holliday, Tomohiro Hoshi & Thomas F. Icard - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic 9. London, England: College Publications. pp. 348-367.
    Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with infinitely (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  24.  74
    Social Choice Should Guide AI Alignment in Dealing with Diverse Human Feedback.Vincent Conitzer, Rachel Freedman, Jobst Heitzig, Wesley H. Holliday, Bob M. Jacobs, Nathan Lambert, Milan Mosse, Eric Pacuit, Stuart Russell, Hailey Schoelkopf, Emanuel Tewolde & William S. Zwicker - forthcoming - Proceedings of the Forty-First International Conference on Machine Learning.
    Foundation models such as GPT-4 are fine-tuned to avoid unsafe or otherwise problematic behavior, such as helping to commit crimes or producing racist text. One approach to fine-tuning, called reinforcement learning from human feedback, learns from humans' expressed preferences over multiple outputs. Another approach is constitutional AI, in which the input from humans is a list of high-level principles. But how do we deal with potentially diverging input from humans? How can we aggregate the input into consistent data about "collective" (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  97
    (1 other version)Partiality and Adjointness in Modal Logic.Wesley H. Holliday - unknown - In Rajeev Gore (ed.), Advances in modal logic, volume. pp. 313-332.
    Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking each individual (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  26.  63
    Indicative Conditionals and Dynamic Epistemic Logic.Wesley H. Holliday & Thomas Icard - 2017 - Proceedings of the Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017), Liverpool, UK, 24-26 July 2017.
    Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal semantics and dynamic epistemic logic in this area can be of mutual benefit. In one direction, we show how concepts and tools from modal logic and dynamic epistemic logic can be used to give a simple, complete axiomatization of Yalcin's [16] semantic consequence relation for (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  27. Conditional and Modal Reasoning in Large Language Models.Wesley H. Holliday & Matthew Mandelkern - manuscript
    The reasoning abilities of large language models (LLMs) are the topic of a growing body of research in artificial intelligence and cognitive science. In this paper, we probe the extent to which a dozen LLMs are able to distinguish logically correct inferences from logically fallacious ones. We focus on inference patterns involving conditionals (e.g., 'If Ann has a queen, then Bob has a jack') and epistemic modals (e.g., 'Ann might have an ace', 'Bob must have a king'). These inference patterns (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  76
    Algebraic and topological semantics for inquisitive logic via choice-free duality.Nick Bezhanishvili, Gianluca Grilletti & Wesley H. Holliday - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. WoLLIC 2019. Lecture Notes in Computer Science, Vol. 11541. Springer. pp. 35-52.
    We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show that inquisitive algebras determine Medvedev’s logic (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  34
    Measuring Violations of Positive Involvement in Voting.Wesley H. Holliday & Eric Pacuit - 2021 - Electronic Proceedings in Theoretical Computer Science 335:189-209.
    In the context of computational social choice, we study voting methods that assign a set of winners to each profile of voter preferences. A voting method satisfies the property of positive involvement (PI) if for any election in which a candidate x would be among the winners, adding another voter to the election who ranks x first does not cause x to lose. Surprisingly, a number of standard voting methods violate this natural property. In this paper, we investigate different ways (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  84
    Inferring Probability Comparisons.Matthew Harrison-Trainor, Wesley H. Holliday & Thomas Icard - 2018 - Mathematical Social Sciences 91:62-70.
    The problem of inferring probability comparisons between events from an initial set of comparisons arises in several contexts, ranging from decision theory to artificial intelligence to formal semantics. In this paper, we treat the problem as follows: beginning with a binary relation ≥ on events that does not preclude a probabilistic interpretation, in the sense that ≥ has extensions that are probabilistically representable, we characterize the extension ≥+ of ≥ that is exactly the intersection of all probabilistically representable extensions of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  56
    Inquisitive Intuitionistic Logic.Wesley H. Holliday - 2020 - In Nicola Olivetti & Rineke Verbrugge (eds.), Advances in Modal Logic, Vol. 11. College Publications. pp. 329-348.
    Inquisitive logic is a research program seeking to expand the purview of logic beyond declarative sentences to include the logic of questions. To this end, inquisitive propositional logic extends classical propositional logic for declarative sentences with principles governing a new binary connective of inquisitive disjunction, which allows the formation of questions. Recently inquisitive logicians have considered what happens if the logic of declarative sentences is assumed to be intuitionistic rather than classical. In short, what should inquisitive logic be on an (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  45
    Arrow's Decisive Coalitions.Wesley H. Holliday & Eric Pacuit - 2020 - Social Choice and Welfare 54:463–505.
    In his classic monograph, Social Choice and Individual Values, Arrow introduced the notion of a decisive coalition of voters as part of his mathematical framework for social choice theory. The subsequent literature on Arrow’s Impossibility Theorem has shown the importance for social choice theory of reasoning about coalitions of voters with different grades of decisiveness. The goal of this paper is a fine-grained analysis of reasoning about decisive coalitions, formalizing how the concept of a decisive coalition gives rise to a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  27
    Learning to Manipulate under Limited Information.Wesley H. Holliday, Alexander Kristoffersen & Eric Pacuit - manuscript
    By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to such strategic manipulation has become a key consideration for comparing voting methods. Here we measure resistance to manipulation by whether neural networks of varying sizes can learn to profitably manipulate a given voting method in expectation, given different types of limited information about how other voters (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  34.  55
    A Note on Algebraic Semantics for $mathsf{S5}$ with Propositional Quantifiers.Wesley H. Holliday - 2019 - Notre Dame Journal of Formal Logic 60 (2):311-332.
    In two of the earliest papers on extending modal logic with propositional quantifiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all elements in a complete Boolean algebra. In this note, we give such a proof. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Epistemic Logic, Relevant Alternatives, and the Dynamics of Context.Wesley H. Holliday - 2012 - Lecture Notes in Computer Science 7415:109-129.
    According to the Relevant Alternatives (RA) Theory of knowledge, knowing that something is the case involves ruling out (only) the relevant alternatives. The conception of knowledge in epistemic logic also involves the elimination of possibilities, but without an explicit distinction, among the possibilities consistent with an agent’s information, between those relevant possibilities that an agent must rule out in order to know and those remote, far-fetched or otherwise irrelevant possibilities. In this article, I propose formalizations of two versions of the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  92
    (1 other version)Axiomatization in the meaning sciences.Wesley H. Holliday & Thomas Icard - 2018 - In Derek Ball & Brian Rabern (eds.), The Science of Meaning: Essays on the Metatheory of Natural Language Semantics. Oxford: Oxford University Press. pp. 73-97.
    While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. In this paper, we highlight some of the benefits (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. On Being in an Undiscoverable Position.Wesley H. Holliday - 2016 - Thought: A Journal of Philosophy 5 (1):33-40.
    The Paradox of the Surprise Examination has been a testing ground for a variety of frameworks in formal epistemology, from epistemic logic to probability theory to game theory and more. In this paper, I treat a related paradox, the Paradox of the Undiscoverable Position, as a test case for the possible-worlds style representation of epistemic states. I argue that the paradox can be solved in this framework, further illustrating the power of possible-worlds style modeling. The solution also illustrates an important (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  15
    An impossibility theorem concerning positive involvement in voting.Wesley H. Holliday - 2024 - Economics Letters 236:111589.
    In social choice theory with ordinal preferences, a voting method satisfies the axiom of positive involvement if adding to a preference profile a voter who ranks an alternative uniquely first cannot cause that alternative to go from winning to losing. In this note, we prove a new impossibility theorem concerning this axiom: there is no ordinal voting method satisfying positive involvement that also satisfies the Condorcet winner and loser criteria, resolvability, and a common invariance property for Condorcet methods, namely that (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39. Freedom and Modality.Wesley H. Holliday - 2017 - In John A. Keller (ed.), Being, Freedom, and Method: Themes From the Philosophy of Peter van Inwagen. New York: Oxford University Press UK. pp. 149-156.
    This paper provides further motivation for a principle relating freedom and modality that appeared in “Freedom and the Fixity of the Past” (The Philosophical Review, Vol. 121), where the principle was used to argue for incompatibilism about freedom and determinism. The paper also replies to objections to that principle from Tognazzini and Fischer (“Incompatibilism and the Past,” this volume).
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  13
    Split Cycle: a new Condorcet-consistent voting method independent of clones and immune to spoilers.Wesley Holliday & Eric Pacuit - 2023 - Public Choice 197:1-62.
    We propose a Condorcet-consistent voting method that we call Split Cycle. Split Cycle belongs to the small family of known voting methods satisfying the anti-vote-splitting criterion of independence of clones. In this family, only Split Cycle satisfies a new criterion we call immunity to spoilers, which concerns adding candidates to elections, as well as the known criteria of positive involvement and negative involvement, which concern adding voters to elections. Thus, in contrast to other clone-independent methods, Split Cycle mitigates both “spoiler (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  9
    An extension of May's Theorem to three alternatives: axiomatizing Minimax voting.Wesley H. Holliday & Eric Pacuit - manuscript
    May's Theorem [K. O. May, Econometrica 20 (1952) 680-684] characterizes majority voting on two alternatives as the unique preferential voting method satisfying several simple axioms. Here we show that by adding some desirable axioms to May's axioms, we can uniquely determine how to vote on three alternatives. In particular, we add two axioms stating that the voting method should mitigate spoiler effects and avoid the so-called strong no show paradox. We prove a theorem stating that any preferential voting method satisfying (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  42.  60
    Compatibility and accessibility: lattice representations for semantics of non-classical and modal logics.Wesley Holliday - 2022 - In David Fernández Duque & Alessandra Palmigiano (eds.), Advances in Modal Logic, Vol. 14. College Publications. pp. 507-529.
    In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Ploščica. The standard representations of complete ortholattices and complete perfect Heyting algebras drop out as special cases of the first representation, while the second covers arbitrary complete lattices, as well as complete lattices equipped with a negation we call a protocomplementation. The third topological representation is a variant of that of Craig, Haviar, and Priestley. We then (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  43.  18
    (1 other version)Moorean Phenomena in Epistemic Logic.Wesley H. Holliday & Thomas F. Icard Iii - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 178-199.
    A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬ BOX p, read as “p is true but you do not know p.” Not only (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  36
    Stable Voting.Wesley H. Holliday & Eric Pacuit - forthcoming - Constitutional Political Economy.
    We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head majority comparison, then A should still win in the election with B included (unless there is another candidate A' who has the same kind of claim to winning, in which case a tiebreaker may choose between such candidates). We call this (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  23
    (1 other version)Epistemic Logic and Epistemology.Wesley H. Holliday - 2012 - In Sven Ove Hansson & Vincent F. Hendricks (eds.), Introduction to Formal Philosophy. Cham: Springer. pp. 351-369.
    This chapter provides a brief introduction to propositional epistemic logic and its applications to epistemology. No previous exposure to epistemic logic is assumed. Epistemic-logical topics discussed include the language and semantics of basic epistemic logic, multi-agent epistemic logic, combined epistemic-doxastic logic, and a glimpse of dynamic epistemic logic. Epistemological topics discussed include Moore-paradoxical phenomena, the surprise exam paradox, logical omniscience and epistemic closure, formalized theories of knowledge, debates about higher-order knowledge, and issues of knowability raised by Fitch’s paradox. The references (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  48
    Does Amy know Ben knows you know your cards? A computational model of higher-order epistemic reasoning.Cedegao Zhang, Huang Ham & Wesley H. Holliday - 2021 - Proceedings of CogSci 2021.
    Reasoning about what other people know is an important cognitive ability, known as epistemic reasoning, which has fascinated psychologists, economists, and logicians. In this paper, we propose a computational model of humans’ epistemic reasoning, including higher-order epistemic reasoning—reasoning about what one person knows about another person’s knowledge—that we test in an experiment using a deductive card game called “Aces and Eights”. Our starting point is the model of perfect higher-order epistemic reasoners given by the framework of dynamic epistemic logic. We (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  51
    Escaping Arrow's Theorem: The Advantage-Standard Model.Wesley Holliday & Mikayla Kelley - forthcoming - Theory and Decision.
    There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility theorems unless one drastically violates the Independence of Irrelevant Alternatives (IIA). In this paper, we present a more positive outlook. We propose a model of comparing candidates in elections, which we call the Advantage-Standard (AS) model. The requirement that a collective choice rule (CCR) be rationalizable by the (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  48.  77
    A note on Murakami’s theorems and incomplete social choice without the Pareto principle.Wesley H. Holliday & Mikayla Kelley - 2020 - Social Choice and Welfare 55:243-253.
    In Arrovian social choice theory assuming the independence of irrelevant alternatives, Murakami (1968) proved two theorems about complete and transitive collective choice rules that satisfy strict non-imposition (citizens’ sovereignty), one being a dichotomy theorem about Paretian or anti-Paretian rules and the other a dictator-or-inverse-dictator impossibility theorem without the Pareto principle. It has been claimed in the later literature that a theorem of Malawski and Zhou (1994) is a generalization of Murakami’s dichotomy theorem and that Wilson’s (1972) impossibility theorem is stronger (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  49.  84
    When Do Introspection Axioms Matter for Multi-Agent Epistemic Reasoning?Wesley H. Holliday, Yifeng Ding & Cedegao Zhang - 2019 - Electronic Proceedings in Theoretical Computer Science 297:121–139.
    The early literature on epistemic logic in philosophy focused on reasoning about the knowledge or belief of a single agent, especially on controversies about "introspection axioms" such as the 4 and 5 axioms. By contrast, the later literature on epistemic logic in computer science and game theory has focused on multi-agent epistemic reasoning, with the single-agent 4 and 5 axioms largely taken for granted. In the relevant multi-agent scenarios, it is often important to reason about what agent A believes about (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  82
    Response to Egré and Xu.Wesley H. Holliday - 2013 - In Johan van Benthem Fenrong Liu (ed.), Logic Across the University: Foundations and Applications. College Publications. pp. 39-46.
    In this note, I respond to comments by Paul Egré and Xu Zhaoqing on my “Epistemic Closure and Epistemic Logic I: Relevant Alternatives and Subjunctivism” (Journal of Philosophical Logic).
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 59