Renata P. de Freitas

Learn More
This work extends Propositional Dynamic Logic (PDL) with parallel composition operator and four atomic programs which formalize the storing and recovering of elements in data structures. A generalization of Kripke semantics is proposed that instead of using set of possible states it uses structured sets of possible states. This new semantics allows for(More)
Descending necrotising mediastinitis can complicate oropharyngeal infection and has a high associated mortality. We present three cases treated in our department and propose a treatment algorithm based on our experience and literature review. The primary oropharyngeal infection was peritonsillar abscess in two cases and odontogenic abscess in one. Two(More)
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasized: natural deduction and graph manipulations. Both provide sound and complete calculi for proving the valid inclusions, supporting nice strategies to obtain proofs in normal form,(More)
The Acrocomia aculeata is one of the most promising plants for sustainable production of renewable energy. In order to understand patterns of the distribution of the allelic diversity of A. aculeata ex situ germplasm collection, the present study investigated the hypothesis that the genetic variability of the accessions may match their geographical origin.(More)
We present a sound and complete logical system for deriving inclusions between graphs from inclusions between graphs, taken as hypotheses. Graphs provide a natural tool for expressing relations and reasoning about them. Here we extend this system to a sound and complete one to cope with proofs from hypotheses. This leads to a system dealing with(More)
In this paper we study the (positive) graph relational calculus. The basis for this calculus was introduced by S. Curtis and G. Lowe in 1996 and some variants, motivated by their applications to semantics of programs and foundations of mathematics, appear scattered in the literature. No proper treatment of these ideas as a logical system seems to have been(More)
We present a system for deriving inclusions between graphs from a set of inclusions between graphs taken as hypotheses. The novel features are the extended notion of graph with an explicitly representation of complement, the more involved definition of the system, and its completeness proof due to the embedding of complements. This is an improvement on(More)
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(More)
We investigate hybridization of Arrow Logic. Hybridization is a general technique for increasing the power of modal logics. A hybrid extension of a given modal logic can be obtained in two stages: first adding a new sort of variables considered as formulas whose intended meaning is to denote points in the domains of the frames then introducing mechanisms(More)