Switch to: References

Add citations

You must login to add citations.
  1. On the basic logic of STIT with a single agent.Ming Xu - 1995 - Journal of Symbolic Logic 60 (2):459-483.
    We present in this paper an axiomatization of Belnap and Perloff's stit theory (a logic of "seeing to it that") with a single agent. The idea of the proof is to apply the notion of companion sets--the same notion as used in another paper by the author that showed the decidability of stit theory with a single agent and Refref equivalence.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Busy choice sequences refraining formulas and modalities.Ming Xu - 1995 - Studia Logica 54 (3):267 - 301.
    The purpose of this paper is to present some results instit theory, a theory of agency proposed by N. Belnap and M. Perloff. We will establish a correspondence between the numbers ofstit modalities and the complexity degrees ofbusy choice sequences in semantic structures, and consequently, a correspondence between the number of modes of actions/inactions instit theory and the complexity degrees ofbusy choice sequences in semantic structures.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Combinations of Stit with Ought and Know.Ming Xu - 2015 - Journal of Philosophical Logic 44 (6):851-877.
    This paper presents a short survey of recent developments in stit theories, with an emphasis on combinations of stit and deontic logic, and those of stit and epistemic logic.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Axioms for deliberative stit.Ming Xu - 1998 - Journal of Philosophical Logic 27 (5):505-552.
    Based on a notion of "companions to stit formulas" applied in other papers dealing with astit logics, we introduce "choice formulas" and "nested choice formulas" to prove the completeness theorems for dstit logics in a language with the dstit operator as the only non-truth-functional operator. The main logic discussed in this paper is the basic logic of dstit with multiple agents, other logics discussed include the basic logic of dstit with a single agent and some logics of dstit with multiple (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Propositional q-logic.Stefan Wölfl - 2002 - Journal of Philosophical Logic 31 (5):387-414.
    Topic of the paper is Q-logic - a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stitoperators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as Δ- or cstit-operator), which has been discussed independently by E v. Kutschera and B. E Chellas, is investigated here in respect of its (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Quantified Temporal Alethic Boulesic Doxastic Logic.Daniel Rönnedal - 2021 - Logica Universalis 15 (1):1-65.
    The paper develops a set of quantified temporal alethic boulesic doxastic systems. Every system in this set consists of five parts: a ‘quantified’ part, a temporal part, a modal (alethic) part, a boulesic part and a doxastic part. There are no systems in the literature that combine all of these branches of logic. Hence, all systems in this paper are new. Every system is defined both semantically and proof-theoretically. The semantic apparatus consists of a kind of$$T \times W$$T×Wmodels, and the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Uncompactness of Stit Logics Containing Generalized Refref Conditionals.Ming Xu - 1998 - Notre Dame Journal of Formal Logic 39 (4):485-506.
    In this paper we prove the uncompactness of every stit logic that contains a generalized refref conditional and is a sublogic of the stit logic with refref equivalence, a syntactical condition of uncompactness that covers infinitely many stit logics. This result is established through the uncompactness of every stit logic whose semantic structures contain no chain of busy choice sequences with cardinality , where is any natural number . The basic idea in the proof is to apply the notion of (...)
    Download  
     
    Export citation  
     
    Bookmark