About this topic
Summary Epistemic logics are logics that allow one to reason about knowledge in some way. The term ‘epistemic logic’ is often applied also to logics of related notions, such as logics of belief (more strictly, doxastic logics) and justification. Many epistemic logics are modal logics, whose language contains one or more knowledge operators and whose semantics is given in terms of relational Kripke models, containing epistemically possible worlds related to one another by epistemic accessibility relations. This modal approach to epistemic logic has been widely adopted in formal logic, philosophy, computer science, artificial intelligence, economics and game theory. The sub-sategory ‘Doxastic and Epistemic Logic’ also includes formal work on belief revision. This category also includes inductive logics and non-monotonic logics, both of which add to the stock of valid inferences, beyond those valid in classical logic. (These logics are super-classical, containing inferences which are not deductively valid and hence, in some sense, less than certain. In such logics, there is no guarantee that truth will be preserved from premises to conclusions. Non-monotonic logics have the feature that an inference from premises X to conclusion A may be valid, and yet the inference to may fail if we add an addition premise B to X, so that XA but not X, B ⊢ A.
Key works Modern epistemic logic began with Hintikka 1962, who developed Kripke-style semantics for epistemic notions and discussed appropriate axioms for knowledge and belief. Hintikka proposes a solution to the logical omniscience problem, whereby agents are treated as automatically knowing all consequences of what they know, in Hintikka 1975. Hintikka's approach is developed and applied to problems in computer science in Fagin et al 1995. The leading theory of belief revision, the ‘AGM’ theory, was first presented in Alchourrón et al 1985. Key early works in inductive logic are Keynes 1929 and Carnap’s 1945, 19521950. Key early works in non-monotonic logic are Moore 1985
Introductions Hintikka 1962 is a great introduction to epistemic and doxastic logics; Hendricks 2008 briefly surveys the area. Huber 2013 introduces and discusses AGM theories of belief revision. Hawthorne 2011 and Huber 2007 are good encyclopaedia entries on inductive logic; Hacking 2001 is a book-length introduction. Antonelli 2008 is a good, brief introduction to non-monotonic logic; an excellent book-length treatment is Makinson 2005
Related categories

1320 found
Order:
1 — 50 / 1320
Material to categorize
  1. Epistemic Logic for Metadata Modelling From Scientific Papers on Covid-19.Simone Cuconato - 2021 - Science and Philosophy 9 (2):83-96.
    The field of epistemic logic developed into an interdisciplinary area focused on explicating epistemic issues in, for example, artificial intelligence, computer security, game theory, economics, multiagent systems and the social sciences. Inspired, in part, by issues in these different ‘application’ areas, in this paper I propose an epistemic logic T for metadata extracted from scientific papers on COVID-19. More in details, I introduce a structure S to syntactically and semantically modelling metadata extracted with systems for extracting structured metadata from scientific (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2. The Role of the Common in Cognitive Prosperity: Our Command of the Unspeakable and Unwriteable.John Woods - 2021 - Logica Universalis 15 (4):399-433.
    There are several features of law which rightly draw the interest of philosophers, especially those whose expertise lies in ethics and social and political philosophy. But the law also has features which haven’t stirred much in the way of philosophical investigation. I must say that I find this surprising. For the fact is that a well-run criminal trial is a master-class in logic and epistemology. Below I examine the logical and epistemological properties of greatest operational involvement in a criminal proceedings, (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. Dynamic Epistemic Logic.Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi - 2007 - Dordrecht, Netherland: Springer.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  4. Knowledge, Justification, and Adequate Reasons.Paul Égré, Paul Marty & Bryan Renne - 2021 - Review of Symbolic Logic 14 (3):687-727.
    Is knowledge definable as justified true belief? We argue that one can legitimately answer positively or negatively, depending on whether or not one’s true belief is justified by what we call adequate reasons. To facilitate our argument we introduce a simple propositional logic of reason-based belief, and give an axiomatic characterization of the notion of adequacy for reasons. We show that this logic is sufficiently flexible to accommodate various useful features, including quantification over reasons. We use our framework to contrast (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Question-Begging Arguments as Ones That Do Not Extend Knowledge.Rainer Ebert - 2019 - Philosophy and Progress 65 (1):125-144.
    In this article, I propose a formal criterion that distinguishes between deductively valid arguments that do and do not beg the question. I define the concept of a Never-failing Minimally Competent Knower (NMCK) and suggest that an argument begs the question just in case it cannot possibly assist an NMCK in extending his or her knowledge.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Multi-Path vs. Single-Path Replies to Skepticism.Wen-Fang Wang - forthcoming - Journal of Philosophical Logic:1-30.
    In order to reply to the contemporary skeptic’s argument for the conclusion that we don’t have any empirical knowledge about the external world, several authors have proposed different fallibilist theories of knowledge that reject the epistemic closure principle. Holliday, 1–62 2015a), however, shows that almost all of them suffer from either the problem of containment or the problem of vacuous knowledge or both. Furthermore, Holliday suggests that the fallibilist should allow a proposition to have multiple sets of relevant alternatives, each (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  7. A Simple Logic of Functional Dependence.Alexandru Baltag & Johan van Benthem - 2021 - Journal of Philosophical Logic 50 (5):939-1005.
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8. Epistemic Logic and CERMINE: A Logical Model for Automatic Extraction of Structured Metadata.Simone Cuconato - 2021 - Science and Philosophy 9 (1):161-172.
    In this article we develop a logical model for automatic extraction of structured metadata. We introduce a new predicate???? – reads ‘extract’ – and a structure???? to syntactically and semantically define metadata extracted with any automatic metadata extraction system. These systems will be considered, in the logical model created, as knowledge extraction agents. In this case KEA taken into consideration is CERMINE, a comprehensive open-source system for extracting structured metadata from scientific articles in a born-digital form.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Logical Maximalism in the Empirical Sciences.Brîncuș Constantin C. - 2021 - In Parusniková Zuzana & Merritt David (eds.), Karl Popper's Science and Philosophy. Springer. pp. 171-184.
    K. R. Popper distinguished between two main uses of logic, the demonstrational one, in mathematical proofs, and the derivational one, in the empirical sciences. These two uses are governed by the following methodological constraints: in mathematical proofs one ought to use minimal logical means (logical minimalism), while in the empirical sciences one ought to use the strongest available logic (logical maximalism). In this paper I discuss whether Popper’s critical rationalism is compatible with a revision of logic in the empirical sciences, (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  10. Inquisitive Bisimulation.Ivano Ciardelli & Martin Otto - 2021 - Journal of Symbolic Logic 86 (1):77-109.
    Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Fragile Knowledge.Simon Goldstein - forthcoming - Mind:1-25.
    This paper explores the principle that knowledge is fragile, in that whenever S knows that S doesn't know that S knows that p, S thereby fails to know p. Fragility is motivated by the infelicity of dubious assertions, utterances which assert p while acknowledging higher order ignorance of p. Fragility is interestingly weaker than KK, the principle that if S knows p, then S knows that S knows p. Existing theories of knowledge which deny KK by accepting a Margin for (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12. The Poss-Ability Principle, G-Cases, and Fitch Propositions.Noah Gordon - 2021 - Logos and Episteme 12 (1):117-125.
    There is a very plausible principle linking abilities and possibilities: If S is able to Φ, then it is metaphysically possible that S Φ’s. Jack Spencer recently proposed a class of counterexamples to this principle involving the ability to know certain propositions. I renew an argument against these counterexamples based on the unknowability of Fitch propositions. In doing so, I provide a new argument for the unknowability of Fitch propositions and show that Spencer’s counterexamples are in tension with a principle (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13. The Logic of Fast and Slow Thinking.Anthia Solaki, Francesco Berto & Sonja Smets - 2021 - Erkenntnis 86 (3):733-762.
    We present a framework for epistemic logic, modeling the logical aspects of System 1 and System 2 cognitive processes, as per dual process theories of reasoning. The framework combines non-normal worlds semantics with the techniques of Dynamic Epistemic Logic. It models non-logically-omniscient, but moderately rational agents: their System 1 makes fast sense of incoming information by integrating it on the basis of their background knowledge and beliefs. Their System 2 allows them to slowly, step-wise unpack some of the logical consequences (...)
    Remove from this list   Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  14. Bisimulations for Knowing How Logics.Raul Fervari, Fernando R. Velázquez-Quesada & Yanjing Wang - forthcoming - Review of Symbolic Logic:1-37.
    As a new type of epistemic logics, the logics of knowing how capture the high-level epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing work on these logics focuses on axiomatizations; this paper makes the first study of their model theoretical properties. It does so by introducing suitable notions of bisimulation for a family of five knowing how logics based on different notions of plans. As an application, we study and compare the expressive power of these (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15. Anti-Realism and Modal-Epistemic Collapse: Reply to Marton.Jan Heylen - forthcoming - Erkenntnis:1-12.
    Marton argues that that it follows from the standard antirealist theory of truth, which states that truth and possible knowledge are equivalent, that knowing possibilities is equivalent to the possibility of knowing, whereas these notions should be distinct. Moreover, he argues that the usual strategies of dealing with the Church–Fitch paradox of knowability are either not able to deal with his modal-epistemic collapse result or they only do so at a high price. Against this, I argue that Marton’s paper does (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16. Epistemic Space of Degradation Processes.Liu Yang & Antoine Rauzy - 2020 - Journal of Applied Non-Classical Logics 31 (1):1-25.
    In this article, we present a new approach of modelling epistemic uncertainties in degradation processes. This approach is established in the framework of finite degradation structures, whic...
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Recapturing Dynamic Logic of Relation Changers Via Bounded Morphisms.Ryo Hatano & Katsuhiko Sano - 2021 - Studia Logica 109 (1):95-124.
    The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by the idea of an auxiliary semantics studied by van Benthem and Wang et al. A key insight of our auxiliary semantics for dynamic logic of relation changers can be described as: “relation changers are bounded morphisms.” Moreover, we demonstrate that this semantic insight can be used to provide a modular cut-free labelled (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. Knowledge Closure and Knowledge Openness: A Study of Epistemic Closure Principles.Levi Spectre - 2009 - Stockholm: Stockholm University.
    The principle of epistemic closure is the claim that what is known to follow from knowledge is known to be true. This intuitively plausible idea is endorsed by a vast majority of knowledge theorists. There are significant problems, however, that have to be addressed if epistemic closure – closed knowledge – is endorsed. The present essay locates the problem for closed knowledge in the separation it imposes between knowledge and evidence. Although it might appear that all that stands between knowing (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19. Induzione e fondazione. Un caso di studio sulla ricezione tedesca del tardo empirismo inglese.Francesco Pisano - 2020 - Archivio di Storia Della Cultura 1 (XXXIII).
    The paper aims at outlining the conceptual frame in which nineteenth-century German philosophy inherits and pursues the British debate on induction. It investigates this debate as a case study for a broader inquiry about the German reception of late British empiricism. The Mill-Whewell controversy on induction is central to the late British empiricism´s project of a logic of natural sciences. It becomes significant in Germany during the second half of the nineteenth century, as a means of defining a theory of (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  20. A Logic of Knowing Why.Chao Xu, Yanjing Wang & Thomas Studer - 2021 - Synthese 198 (2):1259-1285.
    When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  21. Predicate Change: A Study on the Conservativity of Conceptual Change.Corina Strößner - 2020 - Journal of Philosophical Logic 49 (6):1159-1183.
    Like belief revision, conceptual change has rational aspects. The paper discusses this for predicate change. We determine the meaning of predicates by a set of imaginable instances, i.e., conceptually consistent entities that fall under the predicate. Predicate change is then an alteration of which possible entities are instances of a concept. The recent exclusion of Pluto from the category of planets is an example of such a predicate change. In order to discuss predicate change, we define a monadic predicate logic (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22. Short-Circuiting the Definition of Mathematical Knowledge for an Artificial General Intelligence.Samuel Alexander - forthcoming - Lecture Notes in Computer Science.
    We propose that, for the purpose of studying theoretical properties of the knowledge of an agent with Artificial General Intelligence (that is, the knowledge of an AGI), a pragmatic way to define such an agent’s knowledge (restricted to the language of Epistemic Arithmetic, or EA) is as follows. We declare an AGI to know an EA-statement φ if and only if that AGI would include φ in the resulting enumeration if that AGI were commanded: “Enumerate all the EA-sentences which you (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  23. Modal Cognitivism and Modal Expressivism.Hasen Khudairi - manuscript
    This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras, endowed with a hyperintensional truthmaker semantics, comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are dual. I examine, in particular, the virtues unique to the modal expressivist approach here proffered in the setting of (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  24. Reusing Topological Nexttime Logic.Bernhard Heinemann - 2020 - Studia Logica 108 (6):1207-1234.
    In this paper, a particular extension of the constitutive bi-modal logic for single-agent subset spaces will be provided. That system, which originally was designed for revealing the intrinsic relationship between knowledge and topology, has been developed in several directions in recent years, not least towards a comprehensive knowledge-theoretic formalism. This line is followed here to the extent that subset spaces are supplied with a finite number of functions which shall represent certain knowledge-enabling actions. Due to the corresponding functional modalities, another (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  25. Logics for Belief as Maximally Plausible Possibility.Giacomo Bonanno - 2020 - Studia Logica 108 (5):1019-1061.
    We consider a basic logic with two primitive uni-modal operators: one for certainty and the other for plausibility. The former is assumed to be a normal operator, while the latter is merely a classical operator. We then define belief, interpreted as “maximally plausible possibility”, in terms of these two notions: the agent believes \ if she cannot rule out \ ), she judges \ to be plausible and she does not judge \ to be plausible. We consider four interaction properties (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26. Jeffrey Meets Kolmogorov: A General Theory of Conditioning.Alexander Meehan & Snow Zhang - 2020 - Journal of Philosophical Logic 49 (5):941-979.
    Jeffrey conditionalization is a rule for updating degrees of belief in light of uncertain evidence. It is usually assumed that the partitions involved in Jeffrey conditionalization are finite and only contain positive-credence elements. But there are interesting examples, involving continuous quantities, in which this is not the case. Q1 Can Jeffrey conditionalization be generalized to accommodate continuous cases? Meanwhile, several authors, such as Kenny Easwaran and Michael Rescorla, have been interested in Kolmogorov’s theory of regular conditional distributions as a possible (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  27. Revising Probabilities and Full Beliefs.Sven Ove Hansson - 2020 - Journal of Philosophical Logic 49 (5):1005-1039.
    A new formal model of belief dynamics is proposed, in which the epistemic agent has both probabilistic beliefs and full beliefs. The agent has full belief in a proposition if and only if she considers the probability that it is false to be so close to zero that she chooses to disregard that probability. She treats such a proposition as having the probability 1, but, importantly, she is still willing and able to revise that probability assignment if she receives information (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  28. Probability Modals and Infinite Domains.Adam Marushak - 2020 - Journal of Philosophical Logic 49 (5):1041-1055.
    Recent years have witnessed a proliferation of attempts to apply the mathematical theory of probability to the semantics of natural language probability talk. These sorts of “probabilistic” semantics are often motivated by their ability to explain intuitions about inferences involving “likely” and “probably”—intuitions that Angelika Kratzer’s canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds and a qualitative ranking of propositions. However, recent work by Wesley Holliday and Thomas Icard has been widely thought to (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  29. Weakly Aggregative Modal Logic: Characterization and Interpolation.Jixin Liu, Yanjing Wang & Yifeng Ding - 2019 - In Patrick Blackburn, Emiliano Lorini & Meiyun Guo (eds.), Logic, Rationality, and Interaction 7th International Workshop, LORI 2019, Chongqing, China, October 18–21, 2019, Proceedings. pp. 153-167.
    Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig Interpolation.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  30. The Modal Logic LEC for Changing Knowledge, Expressed in the Growing Language.Marcin Łyczak - forthcoming - Logic and Logical Philosophy:1.
    We present the propositional logic LEC for the two epistemic modalities of current and stable knowledge used by an agent who system-atically enriches his language. A change in the linguistic resources of an agent as a result of certain cognitive processes is something that commonly happens. Our system is based on the logic LC intended to formalize the idea that the occurrence of changes induces the passage of time. Here, the primitive operator C read as: it changes that, defines the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31. The Fundamental Problem of Logical Omniscience.Peter Hawke, Aybüke Özgün & Francesco Berto - 2020 - Journal of Philosophical Logic 49 (4):727-766.
    We propose a solution to the problem of logical omniscience in what we take to be its fundamental version: as concerning arbitrary agents and the knowledge attitude per se. Our logic of knowledge is a spin-off from a general theory of thick content, whereby the content of a sentence has two components: an intension, taking care of truth conditions; and a topic, taking care of subject matter. We present a list of plausible logical validities and invalidities for the logic of (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  32. Higher-Order Evidence.Kevin Dorst - forthcoming - In Maria Lasonen-Aarnio & Clayton Littlejohn (eds.), The Routledge Handbook for the Philosophy of Evidence. Routledge.
    On at least one of its uses, ‘higher-order evidence’ refers to evidence about what opinions are rationalized by your evidence. This chapter surveys the foundational epistemological questions raised by such evidence, the methods that have proven useful for answering them, and the potential consequences and applications of such answers.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  33. The Logic of Sequence Frames.Fabio Lampert - forthcoming - Review of Symbolic Logic:1-44.
    This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  34. The Entropy-Limit (Conjecture) for $$Sigma _2$$ Σ 2 -Premisses.Jürgen Landes - 2020 - Studia Logica:1-20.
    The application of the maximum entropy principle to determine probabilities on finite domains is well-understood. Its application to infinite domains still lacks a well-studied comprehensive approach. There are two different strategies for applying the maximum entropy principle on first-order predicate languages: applying it to finite sublanguages and taking a limit; comparing finite entropies of probability functions defined on the language as a whole. The entropy-limit conjecture roughly says that these two strategies result in the same probabilities. While the conjecture is (...)
    Remove from this list   Direct download (6 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  35. Two New Series of Principles in the Interpretability Logic of All Reasonable Arithmetical Theories.Evan Goris & Joost J. Joosten - 2020 - Journal of Symbolic Logic 85 (1):1-25.
    The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.The logic IL is defined as the collection of modal principles that are provable in any moderately sound theory of some minimal strength. In this article (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36. Bilattice Logic of Epistemic Actions and Knowledge.Zeinab Bakhtiari, Hans van Ditmarsch & Umberto Rivieccio - 2020 - Annals of Pure and Applied Logic 171 (6):102790.
    Baltag, Moss, and Solecki proposed an expansion of classical modal logic, called logic of epistemic actions and knowledge (EAK), in which one can reason about knowledge and change of knowledge. Kurz and Palmigiano showed how duality theory provides a flexible framework for modeling such epistemic changes, allowing one to develop dynamic epistemic logics on a weaker propositional basis than classical logic (for example an intuitionistic basis). In this paper we show how the techniques of Kurz and Palmigiano can be further (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Implicit and Explicit Stances in Logic.Johan Benthem - 2019 - Journal of Philosophical Logic 48 (3):571-601.
    We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  38. A Remark on Probabilistic Measures of Coherence.Sergi Oms - 2020 - Notre Dame Journal of Formal Logic 61 (1):129-140.
    In recent years, some authors have proposed quantitative measures of the coherence of sets of propositions. Such probabilistic measures of coherence are, in general terms, functions that take as their argument a set of propositions and yield as their value a number that is supposed to represent the degree of coherence of the set. In this paper, I introduce a minimal constraint on PMC theories, the weak stability principle, and show that any correct, coherent, and complete PMC cannot satisfy it. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39. From Concepts to Predicates Within Constructivist Epistemology.Farshad Badie - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction. Berlin, Germany: Springer.
    In this research constructivist epistemology provides a ground for conceptual analysis of concept construction, conception production, and concept learning processes. Relying on a constructivist model of knowing, this research will make an epistemological and logical linkage between concepts and predicates.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Review of Bayesian Epistemology.Erik J. Olsson - 2005 - Studia Logica 81:443-446.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  41. The Value of Biased Information.Nilanjan Das - forthcoming - British Journal for the Philosophy of Science:axaa003.
    In this essay, I cast doubt on an apparent truism: namely, that if evidence is available for gathering and use at a negligible cost, then it's always instrumentally rational for us to gather that evidence and use it for making decisions. Call this thesis Value of Information. I show that Value of Information conflicts with two other plausible theses. The first is the view that an agent's evidence can entail non-trivial propositions about the external world. The second is the view (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42. Pure Inductive Logic with Functions.Elizabeth Howarth & Jeffrey B. Paris - 2019 - Journal of Symbolic Logic 84 (4):1382-1402.
    We consider the version of Pure Inductive Logic which obtains for the language with equality and a single unary function symbol giving a complete characterization of the probability functions on this language which satisfy Constant Exchangeability.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Dynamic Graded Epistemic Logic.Minghui Ma & Hans van Ditmarsch - 2019 - Review of Symbolic Logic 12 (4):663-684.
    Graded epistemic logic is a logic for reasoning about uncertainties. Graded epistemic logic is interpreted on graded models. These models are generalizations of Kripke models. We obtain completeness of some graded epistemic logics. We further develop dynamic extensions of graded epistemic logics, along the framework of dynamic epistemic logic. We give an extension with public announcements, i.e., public events, and an extension with graded event models, a generalization also including nonpublic events. We present complete axiomatizations for both logics.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44. Small Infinitary Epistemic Logics.Tai-wei Hu, Mamoru Kaneko & Nobu-Yuki Suzuki - 2019 - Review of Symbolic Logic 12 (4):702-735.
    We develop a series of small infinitary epistemic logics to study deductive inference involving intra-/interpersonal beliefs/knowledge such as common knowledge, common beliefs, and infinite regress of beliefs. Specifically, propositional epistemic logics GL are presented for ordinal α up to a given αo so that GL is finitary KDn with n agents and GL allows conjunctions of certain countably infinite formulae. GL is small in that the language is countable and can be constructive. The set of formulae Lα is increasing up (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. Completeness for Counter-Doxa Conditionals – Using Ranking Semantics.Eric Raidl - 2019 - Review of Symbolic Logic 12 (4):861-891.
    Standard conditionals $\varphi > \psi$, by which I roughly mean variably strict conditionals à la Stalnaker and Lewis, are trivially true for impossible antecedents. This article investigates three modifications in a doxastic setting. For the neutral conditional, all impossible-antecedent conditionals are false, for the doxastic conditional they are only true if the consequent is absolutely necessary, and for the metaphysical conditional only if the consequent is ‘model-implied’ by the antecedent. I motivate these conditionals logically, and also doxastically by properties of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  46. Non-Monotonic Logic and the Compatibility of Science and Religion.Marcin Trepczyński - 2019 - Logica Universalis 13 (4):457-466.
    The article aims to show how the acceptance of non-monotonic logic enables arguments to be held between science and religion in a way that does not exclude either of these two spheres. The starting point of the analyses is the idea of the 13th century Danish philosopher, Boethius of Dacia, who states that it is both acceptable that: a natural scientist negates that the world had a beginning, and a Christian theologian asserts that the world had a beginning, because each (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Intensional Protocols for Dynamic Epistemic Logic.Hanna S. van Lee, Rasmus K. Rendsvig & Suzanne van Wijk - 2019 - Journal of Philosophical Logic 48 (6):1077-1118.
    In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic, called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate are characterized. This facilitates a formal (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48. Intensional Protocols for Dynamic Epistemic Logic.Suzanne Wijk, Rasmus Rendsvig & Hanna Lee - 2019 - Journal of Philosophical Logic 48 (6):1077-1118.
    In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic, called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate are characterized. This facilitates a formal (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  49. Epistemic Logic, Monotonicity, and the Halbach–Welch Rapprochement Strategy.Kyle Banick - 2019 - Studia Logica 107 (4):669-693.
    Predicate approaches to modality have been a topic of increased interest in recent intensional logic. Halbach and Welch :71–100, 2009) have proposed a new formal technique to reduce the necessity predicate to an operator, demonstrating that predicate and operator methods are ultimately compatible. This article concerns the question of whether Halbach and Welch’s approach can provide a uniform formal treatment for intensionality. I show that the monotonicity constraint in Halbach and Welch’s proof for necessity fails for almost all possible-worlds theories (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Propositional Epistemic Logics with Quantification Over Agents of Knowledge (An Alternative Approach).Gennady Shtakser - 2019 - Studia Logica 107 (4):753-780.
    In the previous paper with a similar title :311–344, 2018), we presented a family of propositional epistemic logics whose languages are extended by two ingredients: by quantification over modal operators or over agents of knowledge and by predicate symbols that take modal operators as arguments. We denoted this family by \}\). The family \}\) is defined on the basis of a decidable higher-order generalization of the loosely guarded fragment of first-order logic. And since HO-LGF is decidable, we obtain the decidability (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1320