16 found
Sort by:
Disambiguations:
Rineke Verbrugge [15]Rineke Verbrugge [1]
  1. Sujata Ghosh, Ben Meijering & Rineke Verbrugge (2014). Strategic Reasoning: Building Cognitive Models From Logical Formulas. Journal of Logic, Language and Information 23 (1):1-29.
    This paper presents an attempt to bridge the gap between logical and cognitive treatments of strategic reasoning in games. There have been extensive formal debates about the merits of the principle of backward induction among game theorists and logicians. Experimental economists and psychologists have shown that human subjects, perhaps due to their bounded resources, do not always follow the backward induction strategy, leading to unexpected outcomes. Recently, based on an eye-tracking study, it has turned out that even human subjects who (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Jakub Szymanik & Rineke Verbrugge (2013). Logic and Cognition: Special Issue of Best Papers of the ESSLLI 2012 Workshop. Journal of Logic, Language and Information 22 (4):357-362.
    The explanatory power of logic is vast and therefore it has proved a valuable tool for many disciplines, including the building-blocks of cognitive science, such as philosophy, computer science, mathematics, artificial intelligence, and linguistics. Logic has a great track record in providing interesting insights by means of formalization, and as such it is very useful in disambiguating psychological theories. Logically formalized cognitive theories are not only the source of unequivocal experimental hypotheses, but they also lend themselves naturally to computational modeling. (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Dick De Jongh, Rineke Verbrugge & Albert Visser (2011). Intermediate Logics and the de Jongh Property. Archive for Mathematical Logic 50 (1):197-213.
    We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Egon van Baars & Rineke Verbrugge (2009). A Communication Algorithm for Teamwork in Multi-Agent Environments. Journal of Applied Non-Classical Logics 19 (4):431-461.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Rineke Verbrugge (2009). Logic and Social Cognition. Journal of Philosophical Logic 38 (6):649 - 680.
    This article takes off from Johan van Benthem’s ruminations on the interface between logic and cognitive science in his position paper “Logic and reasoning: Do the facts matter?”. When trying to answer Van Benthem’s question whether logic can be fruitfully combined with psychological experiments, this article focuses on a specific domain of reasoning, namely higher-order social cognition, including attributions such as “Bob knows that Alice knows that he wrote a novel under pseudonym”. For intelligent interaction, it is important that the (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  6. Rineke Verbrugge (2009). Logic and Social Cognition the Facts Matter, and so Do Computational Models. Journal of Philosophical Logic 38 (6):649-680.
    This article takes off from Johan van Benthem’s ruminations on the interface between logic and cognitive science in his position paper “Logic and reasoning: Do the facts matter?”. When trying to answer Van Benthem’s question whether logic can be fruitfully combined with psychological experiments, this article focuses on a specific domain of reasoning, namely higher-order social cognition, including attributions such as “Bob knows that Alice knows that he wrote a novel under pseudonym”. For intelligent interaction, it is important that the (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. 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  
  8. Liesbeth Flobbe, Rineke Verbrugge, Petra Hendriks & Irene Krämer (2008). Children's Application of Theory of Mind in Reasoning and Language. Journal of Logic, Language and Information 17 (4):417-442.
    Many social situations require a mental model of the knowledge, beliefs, goals, and intentions of others: a Theory of Mind (ToM). If a person can reason about other people’s beliefs about his own beliefs or intentions, he is demonstrating second-order ToM reasoning. A standard task to test second-order ToM reasoning is the second-order false belief task. A different approach to investigating ToM reasoning is through its application in a strategic game. Another task that is believed to involve the application of (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. Rineke Verbrugge, Provability Logic. Stanford Encyclopedia of Philosophy.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Rineke Verbrugge & Lisette Mol (2008). Learning to Apply Theory of Mind. Journal of Logic, Language and Information 17 (4):489-511.
    In everyday life it is often important to have a mental model of the knowledge, beliefs, desires, and intentions of other people. Sometimes it is even useful to to have a correct model of their model of our own mental states: a second-order Theory of Mind. In order to investigate to what extent adults use and acquire complex skills and strategies in the domains of Theory of Mind and the related skill of natural language use, we conducted an experiment. It (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. 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  
  12. 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  
  13. 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  
  14. Rineke Verbrugge (1999). Review: J.-J. Ch. Meyer, W. Van Der Hoek, Epistemic Logic for AI and Computer Science. [REVIEW] Journal of Symbolic Logic 64 (4):1837-1840.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. Rineke Verbrugge & Albert Visser (1994). A Small Reflection Principle for Bounded Arithmetic. Journal of Symbolic Logic 59 (3):785-812.
    We investigate the theory IΔ 0 + Ω 1 and strengthen [Bu86. Theorem 8.6] to the following: if NP ≠ co-NP. then Σ-completeness for witness comparison formulas is not provable in bounded arithmetic. i.e. $I\delta_0 + \Omega_1 + \nvdash \forall b \forall c (\exists a(\operatorname{Prf}(a.c) \wedge \forall = \leq a \neg \operatorname{Prf} (z.b))\\ \rightarrow \operatorname{Prov} (\ulcorner \exists a(\operatorname{Prf}(a. \bar{c}) \wedge \forall z \leq a \neg \operatorname{Prf}(z.\bar{b})) \urcorner)).$ Next we study a "small reflection principle" in bounded arithmetic. We prove that for (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  16. Rineke Verbrugge & Alessandro Berarducci (1993). On the Provability Logic of Bounded Arithmetic. Annals of Pure and Applied Logic 61 (1-2):75-93.
    Let PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L ⊆ PLω < Th(C) where L is the provability logic of PA and Th(C) is a suitable class of Kripke frames.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation