31 found
Sort by:
Disambiguations:
Barteld Kooi [21]Barteld Kooi [7]Barteld P. Kooi [3]
  1. Lorenz Demey, Barteld Kooi & Joshua Sack (forthcoming). Logic and Probability. Stanford Encyclopedia of Philosophy.
    No categories
     
    My bibliography  
     
    Export citation  
  2. Barteld Kooi & Allard Tamminga (2013). Three-Valued Logics in Modal Logic. Studia Logica 101 (5):1061-1072.
    Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Barteld Kooi & Allard Tamminga (2012). Completeness Via Correspondence for Extensions of the Logic of Paradox. Review of Symbolic Logic 5 (4):720-730.
    Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (LP). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to LP by an inference scheme. Second, we define a class of natural deduction systems on the basis of these characterizing inference schemes and a natural deduction system for LP. Third, (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  4. Wiebe van der Hoek, Hans van Ditmarsch & Barteld Kooi, Reasoning About Local Properties in Modal Logic.
    Hans van Ditmarsch, Wiebe van der Hoek and Barteld Kooi (2011). Reasoning about local properties in modal logic. In K. Tumer and P. Yolum and L. Sonenberg and P. Stone (editors). Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 711-718.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Petar Iliev, Wiebe van Der Hoek, Tim French & Barteld Kooi, Succinctness of Epistemic Languages.
    Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo Park.
    No categories
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. Barteld Kooi, Wiebe van der Hoek, Petar Iliev & Tim French, Succinctness of Epistemic Languages.
    Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo Park.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Barteld Kooi & Bryan Renne (2011). Arrow Update Logic. Review of Symbolic Logic 4 (4):536-559.
    We present Arrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing of Arrow Update Logic can be transformed into equivalent belief-changing from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logicrelativized” common knowledge familiar from the Dynamic Epistemic Logic literature.
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  8. Bryan Renne & Barteld Kooi, Generalized Arrow Update Logic.
    Barteld Kooi and Bryan Renne (2011). Generalized Arrow Update Logic. In K.R. Apt (editor). Theoretical Aspects of Rationality and Knowledge, Proceedings of the Thirteenth Conference (TARK 2011), pp. 205-211.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Johan van Benthem, Jelle Gerbrandy & Barteld Kooi (2009). Dynamic Update with Probabilities. Studia Logica 93 (1):67 - 96.
    Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Johan van Benthem, Jelle Gerbrandy & Barteld Kooi (2009). Dynamic Update with Probabilities. Studia Logica 93 (1):67-96.
    Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge (2008). Strong Completeness and Limited Canonicity for PDL. Journal of Logic, Language and Information 17 (1):291-292.
    Propositional dynamic logic () is complete but not compact. As a consequence, strong completeness (the property ) requires an infinitary proof system. In this paper, we present a short proof for strong completeness of relative to an infinitary proof system containing the rule from [α; β n ]φ for all , conclude . The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  12. Kooi, Barteld, Dynamic Term-Modal Logic.
    abstract. A first-order dynamic epistemic logic is developed where the names of the agents are also terms in the sense of first-order logic. Consequently one can quantify over epistemic modalities. Us- ing constructs from dynamic logic one can express many interesting concepts. First-order update models are developed and added to the language as modalities.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Barteld Kooi & Allard Tamminga (2008). Moral Conflicts Between Groups of Agents. Journal of Philosophical Logic 37 (1):1-21.
    Two groups of agents, G1 and G2, face a *moral conflict* if G1 has a moral obligation and G2 has a moral obligation, such that these obligations cannot both be fulfilled. We study moral conflicts using a multi-agent deontic logic devised to represent reasoning about sentences like "In the interest of group F of agents, group G of agents ought to see to it that phi". We provide a formal language and a consequentialist semantics. An illustration of our semantics with (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  14. van Ditmarsch, Hans & Kooi, Barteld, Semantic Results for Ontic and Epistemic Change.
    Hans van Ditmarsch and Barteld Kooi (2008). Semantic results for ontic and epistemic change. In: G. Bonanno, W. van der Hoek and M. Wooldridge (editors). Logic and the Foundations of Game and Decision Theory (LOFT 7). Texts in Logic and Games 3, pp. 87-117, Amsterdam University Press, Amsterdam.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  15. Barteld Kooi (2007). De logica van informati everandering. Algemeen Nederlands Tijdschrift Voor Wijsbegeerte 99 (2):146-153.
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  16. Kooi, Barteld (2007). Expressivity and Completeness for Public Update Logics Via Reduction Axioms. Journal of Applied Non-Classical Logics 17 (2):231-253.
    In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  17. Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge (2007). Strong Completeness and Limited Canonicity for PDL. Journal of Logic, Language and Information 17 (1):69-87.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  18. Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
    In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  19. Kooi, Barteld, Renardel de Lavalette, Gerard & Verbrugge, Rineke, Hybrid Logics with Infinitary Proof Systems.
    We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  20. Kooi, Barteld & van Benthem, Johan, Reduction Axioms for Epistemic Actions.
    Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added. In this paper we propose new versions that extend the underlying static epistemic language in such a way that dynamic completeness proofs can be obtained by perspicuous reduction axioms.
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  21. Barteld Kooi & Hans Van Ditmarsch (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
    In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...)
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  22. Barteld Kooi, Jan van Eijck & Johan van Benthem, Logics of Communication and Change.
    Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous ‘reduction axioms’. We also (...)
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. van Benthem, Johan, van Eijck, Jan & Kooi, Barteld, Logics of Communication and Change.
    Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous ‘reduction axioms’. We also (...)
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 151 (2):201-232.
    In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is ‘fact p is true and you don’t know that’, after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...)
    No categories
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  25. Rineke Verbrugge, Gerard Renardel de Lavalette & Barteld Kooi, Hybrid Logics with Infinitary Proof Systems.
    We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Casper J. Albers, Barteld P. Kooi & Willem Schaafsma (2005). Trying to Resolve the Two-Envelope Problem. Synthese 145 (1):89 - 109.
    After explaining the well-known two-envelope paradox by indicating the fallacy involved, we consider the two-envelope problem of evaluating the factual information provided to us in the form of the value contained by the envelope chosen first. We try to provide a synthesis of contributions from economy, psychology, logic, probability theory (in the form of Bayesian statistics), mathematical statistics (in the form of a decision-theoretic approach) and game theory. We conclude that the two-envelope problem does not allow a satisfactory solution. An (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  27. Kooi, Barteld, Yet Another Mastermind Strategy.
    Over the years a lot of easily computable strategies for the game mastermind have been proposed. One of the obvious strategies, guess that code that has the most possible answers, has been lacking. It is discussed in this paper.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  28. Hans van Ditmarsch & Barteld Kooi (2005). Een Analyse van de Hangman Paradox in Dynamische Epistemische Logica. Algemeen Nederlands Tijdschrift Voor Wijsbegeerte 97:16-30.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  29. Johan van Benthem & Barteld Kooi, Reduction Axioms for Epistemic Actions.
    Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added. In this paper we propose new versions that extend the underlying static epistemic language in such a way that dynamic completeness proofs can be obtained by perspicuous reduction axioms.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  30. Barteld P. Kooi (2003). Probabilistic Dynamic Epistemic Logic. Journal of Logic, Language and Information 12 (4):381-408.
    In this paper I combine the dynamic epistemic logic ofGerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The resultis a new probabilistic dynamic epistemic logic, a logic for reasoning aboutprobability, information, and information change that takes higher orderinformation into account. Probabilistic epistemic models are defined, and away to build them for applications is given. Semantics and a proof systemis presented and a number of examples are discussed, including the MontyHall Dilemma.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  31. Hans P. van Ditmarsch & Barteld P. Kooi (2002). Spelen met verandering en onzekerheid. Rationele-keuzetheorie en logica. Algemeen Nederlands Tijdschrift Voor Wijsbegeerte 94 (1).
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation