12 found
Order:
  1.  16
    On Vague Notions and Modalities: A Modular Approach.Paulo Veloso, Sheila Veloso, Petrúcio Viana, Renata de Freitas & Mario Benevides - 2010 - Logic Journal of the IGPL 18 (3):381-402.
    Vague notions, such as ‘generally’, ‘rarely’, ‘often’, ‘almost always’, ‘a meaningful subset of a whole’, ‘most’, etc., occur often in ordinary language and in some branches of science. We introduce modal logical systems, with generalized operators, for the precise treatment of assertions involving some versions of such vague notions. We examine modal logics, constructed in a modular fashion, with generalized operators corresponding to some versions of ‘generally’ and ‘rarely’.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  5
    On Vague Notions and Modalities: A Modular Approach.P. A. S. Veloso, S. R. M. Veloso, P. Viana, R. D. Freitas, M. Benevides & C. Delgado - 2010 - Logic Journal of the IGPL 18 (3):381-402.
  3.  12
    Using Modal Logics to Express and Check Global Graph Properties.Mario Benevides & L. Schechter - 2009 - Logic Journal of the IGPL 17 (5):559-587.
    Graphs are among the most frequently used structures in Computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and Hamiltonian properties. In this work, we analyze how we can express these four properties with modal logics. This involves two issues: whether each of the modal languages under consideration has enough expressive power to describe these properties and how complex it is to use these logics to actually test whether a given (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  28
    Squares in Fork Arrow Logic.Renata P. de Freitas, Jorge P. Viana, Mario R. F. Benevides, Sheila R. M. Veloso & Paulo A. S. Veloso - 2003 - Journal of Philosophical Logic 32 (4):343-355.
    In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  5.  18
    Squares in Fork Arrow Logic.Renata P. De Freitas, Jorge P. Viana, Mario R. F. Benevides, Sheila R. M. Veloso & Paulo A. S. Veloso - 2003 - Journal of Philosophical Logic 32 (4):343 - 355.
    In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  21
    On Fork Arrow Logic and its Expressive Power.Paulo A. S. Veloso, Renata P. de Freitas, Petrucio Viana, Mario Benevides & Sheila R. M. Veloso - 2007 - Journal of Philosophical Logic 36 (5):489 - 509.
    We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  7.  9
    Formalizing Concurrent Common Knowledge as Product of Modal Logics.Vania Costa & Mario Benevides - 2005 - Logic Journal of the IGPL 13 (6):665-684.
    This work introduces a two-dimensional modal logic to represent agents' Concurrent Common Knowledge in distributed systems. Unlike Common Knowledge, Concurrent Common Knowledge is a kind of agreement reachable in asynchronous environments. The formalization of such type of knowledge is based on a model for asynchronous systems and on the definition of Concurrent Knowledge introduced before in paper [5]. As a proper semantics, we review our concept of closed sub-product of modal logics which is based on the product of modal logics. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  8.  11
    On Fork Arrow Logic and Its Expressive Power.Paulo A. S. Veloso, Renata P. De Freitas, Petrucio Viana, Mario Benevides & Sheila R. M. Veloso - 2007 - Journal of Philosophical Logic 36 (5):489 - 509.
    We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  6
    Propositional Dynamic Logic for Petri Nets.B. Lopes, M. Benevides & E. H. Haeusler - 2014 - Logic Journal of the IGPL 22 (5):721-736.
  10.  6
    PDL for Structured Data: A Graph-Calculus Approach.P. A. S. Veloso, S. R. M. Veloso & M. R. F. Benevides - 2014 - Logic Journal of the IGPL 22 (5):737-757.
  11.  3
    Reasoning About Knowledge in Asynchronous Distributed Systems.Vania Costa & Mario Benevides - 2005 - Logic Journal of the IGPL 13 (1):5-28.
    This paper introduces a two-dimensional modal logic to reason about knowledge in asynchronous multi-agent message-passing systems. We present a new theoretical definition for concurrent knowledge in order to describe the kind of knowledge typical in such asynchronous environments. To define concurrent knowledge, we propose the closed sub-product of modal logics: a two-dimensional formal semantics where one dimension corresponds to asynchronous runs, the other corresponds to consistent cuts and the concurrent knowledge is defined as the transitive closure over the product of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. Democracia e cidadania.Maria Vitória Benevides - 1994 - Polis 14:11-9.
    Translate
     
     
    Export citation  
     
    Bookmark