14 found
Order:
See also
  1.  45
    Reasoning About Knowledge.Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Vardi - 1995 - MIT Press.
    Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...
    Direct download  
     
    Export citation  
     
    Bookmark   314 citations  
  2.  40
    Probabilities on Finite Models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.
  3. What is an Inference Rule?Ronald Fagin, Joseph Y. Halpern & Moshe Y. Vardi - 1992 - Journal of Symbolic Logic 57 (3):1018-1045.
    What is an inference rule? This question does not have a unique answer. One usually finds two distinct standard answers in the literature; validity inference $(\sigma \vdash_\mathrm{v} \varphi$ if for every substitution $\tau$, the validity of $\tau \lbrack\sigma\rbrack$ entails the validity of $\tau\lbrack\varphi\rbrack)$, and truth inference $(\sigma \vdash_\mathrm{t} \varphi$ if for every substitution $\tau$, the truth of $\tau\lbrack\sigma\rbrack$ entails the truth of $\tau\lbrack\varphi\rbrack)$. In this paper we introduce a general semantic framework that allows us to investigate the notion of inference (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  4.  15
    Monadic Generalized Spectra.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):89-96.
  5.  16
    Reachability is Harder for Directed Than for Undirected Finite Graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
    Although it is known that reachability in undirected finite graphs can be expressed by an existential monadic second-order sentence, our main result is that this is not the case for directed finite graphs (even in the presence of certain "built-in" relations, such as the successor relation). The proof makes use of Ehrenfeucht-Fraisse games, along with probabilistic arguments. However, we show that for directed finite graphs with degree at most k, reachability is expressible by an existential monadic second-order sentence.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  6.  26
    A Quantitative Analysis of Modal Logic.Ronald Fagin - 1994 - Journal of Symbolic Logic 59 (1):209-252.
    We do a quantitative analysis of modal logic. For example, for each Kripke structure M, we study the least ordinal μ such that for each state of M, the beliefs of up to level μ characterize the agents' beliefs (that is, there is only one way to extend these beliefs to higher levels). As another example, we show the equivalence of three conditions, that on the face of it look quite different, for what it means to say that the agents' (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  7.  8
    Common Knowledge Revisited.Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi - 1999 - Annals of Pure and Applied Logic 96 (1-3):89-105.
  8.  19
    A Spectrum Hierarchy.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):123-134.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  9.  25
    Reasoning About Knowledge: A Response by the Authors. [REVIEW]Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi - 1997 - Minds and Machines 7 (1):113-113.
  10.  50
    I'm OK If You're OK: On the Notion of Trusting Communication. [REVIEW]Ronald Fagin & Joseph Y. Halpern - 1988 - Journal of Philosophical Logic 17 (4):329 - 354.
    We consider the issue of what an agent or a processor needs to know in order to know that its messages are true. This may be viewed as a first step to a general theory of cooperative communication in distributed systems. An honest message is one that is known to be true when it is sent (or said). If every message that is sent is honest, then of course every message that is sent is true. Various weaker considerations than honesty (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  32
    Comparing the Power of Games on Graphs.Ronald Fagin - 1997 - Mathematical Logic Quarterly 43 (4):431-455.
    The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in the order in which the spoiler and duplicator make various moves. In one of these games, the rules seem to be tilted towards favoring (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  12.  16
    Review: Ronald Fagin, Moshe Y. Vardi, Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report.William J. Rapaport, Ronald Fagin & Moshe Y. Vardi - 1988 - Journal of Symbolic Logic 53 (2):667.
  13.  13
    Fifth Conference on Theoretical Aspects of Reasoning About Knowledge (TARK V).Ronald Fagin - 1993 - Journal of Logic, Language, and Information 2 (338).
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  10
    A Two‐Cardinal Characterization of Double Spectra.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):121-122.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark