6 found
Sort by:
  1. Arthur Buchsbaum & Jean-Yves Beziau, Introduction of Implication and Generalization in Axiomatic Calculi.
    of implication and generalization rules have a close relationship, for which there is a key idea for clarifying how they are connected: varying objects. Varying objects trace how generalization rules are used along a demonstration in an axiomatic calculus. Some ways for introducing implication and for generalization are presented here, taking into account some basic properties that calculi can have.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Arthur Buchsbaum, Tarcisio Pequeno & Marcelino Pequeno (2007). A Logical Expression of Reasoning. Synthese 154 (3):431 - 466.
    A non-monotonic logic, the Logic of Plausible Reasoning (LPR), capable of coping with the demands of what we call complex reasoning, is introduced. It is argued that creative complex reasoning is the way of reasoning required in many instances of scientific thought, professional practice and common life decision taking. For managing the simultaneous consideration of multiple scenarios inherent in these activities, two new modalities, weak and strong plausibility, are introduced as part of the Logic of Plausible Deduction (LPD), a deductive (...)
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Arthur Buchsbaum & Tarcisio Pequeno (1997). A General Treatment for the Deduction Theorem in Open Calculi. Logique Et Analyse 157:9-29.
     
    My bibliography  
     
    Export citation  
  4. Arthur Buchsbaum, Tarcisio Pequeno, A. General, Newton Ca da Costa & Jean-Yves Beziau (1997). Contemporary Brazilian Research in Logic Part II. Logique Et Analyse 40:3.
     
    My bibliography  
     
    Export citation  
  5. Arthur Buchsbaum, Tarcisio Pequeno, A. General, Newton Ca da Costa & Jean-Yves Beziau (1997). Table Des Matteres Contemporary Brazilian Research in Logic Parte. Logique Et Analyse 40:6.
     
    My bibliography  
     
    Export citation  
  6. Arthur Buchsbaum & Tarcisio Pequeno (1993). A Reasoning Method for a Paraconsistent Logic. Studia Logica 52 (2):281 - 289.
    A proof method for automation of reasoning in a paraconsistent logic, the calculus C1* of da Costa, is presented. The method is analytical, using a specially designed tableau system. Actually two tableau systems were created. A first one, with a small number of rules in order to be mathematically convenient, is used to prove the soundness and the completeness of the method. The other one, which is equivalent to the former, is a system of derived rules designed to enhance computational (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation