18 found
Order:
Disambiguations
Tomasz Skura [17]Tomasz F. Skura [1]
  1.  65
    A Refutation Theory.Tomasz Skura - 2009 - Logica Universalis 3 (2):293-302.
    A general theory of refutation systems is given. Some applications (concerning maximality and minimality in lattices of logics) are also discussed.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  2.  10
    A System for Proper Multiple-Conclusion Entailment.Tomasz Skura & Andrzej Wiśniewski - 2015 - Logic and Logical Philosophy 24 (2).
  3.  9
    Refutation Calculi for Certain Intermediate Propositional Logics.Tomasz Skura - 1992 - Notre Dame Journal of Formal Logic 33 (4):552-560.
  4.  26
    A Łukasiewicz-Style Refutation System for the Modal Logic S.Tomasz Skura - 1995 - Journal of Philosophical Logic 24 (6):573 - 582.
  5.  14
    Intuitionistic Socratic Procedures.Tomasz F. Skura - 2005 - Journal of Applied Non-Classical Logics 15 (4):453-464.
    In the paper we study the method of Socratic proofs in the intuitionistic propositional logic as a reduction procedure. Our approach consists in constructing for a given sequent α a finite tree of sets of sequents by using invertible reduction rules of the kind: ? is valid if and only if ?1 is valid or... or ?n is valid. From such a tree either a Gentzen-style proof of α or an Aristotle-style refutation of α can also be extracted.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  6. Aspects of Refutation Procedures in the Intuitionistic Logic and Related Modal Systems.Tomasz Skura - 1999
     
    Export citation  
     
    Bookmark   3 citations  
  7.  9
    On Pure Refutation Formulations of Sentential Logics.Tomasz Skura - 1990 - Bulletin of the Section of Logic 19 (3):102-107.
  8.  34
    On Refutation Rules.Tomasz Skura - 2011 - Logica Universalis 5 (2):249-254.
    The goal of this paper is to generalize specific techniques connected with refutation rules involving certain normal forms. In particular, a method of axiomatizing both a logic L and its complement −L is introduced.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  31
    On Decision Procedures for Sentential Logics.Tomasz Skura - 1991 - Studia Logica 50 (2):173 - 179.
    In Section 2 I give a criterion of decidability that can be applied to logics (i.e. Tarski consequence operators) without the finite model property. In Section 3 I study ukasiewicz-style refutation procedures as a method of obtaining decidability results.This method also proves to be more general than Harrop's criterion.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10.  7
    Syntactic Refutations Against Finite Models in Modal Logic.Tomasz Skura - 1994 - Notre Dame Journal of Formal Logic 35 (4):595-605.
    The purpose of the paper is to study syntactic refutation systems as a way of characterizing normal modal propositional logics. In particular it is shown that there is a decidable modal logic without the finite model property that has a simple finite refutation system.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  11.  11
    Refutations and Proofs in S4.Tomasz Skura - 1996 - In H. Wansing (ed.), Proof Theory of Modal Logic. Kluwer Academic Publishers.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  12.  52
    Refutations, Proofs, and Models in the Modal Logic K.Tomasz Skura - 2002 - Studia Logica 70 (2):193 - 204.
    In this paper we study the method of refutation rules in the modal logic K4. We introduce refutation rules with certain normal forms that provide a new syntactic decision procedure for this logic. As corollaries we obtain such results for the following important extensions: S4, the provability logic G, and Grzegorczyk''s logic. We also show that tree-type models can be constructed from syntactic refutations of this kind.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  8
    Refutations, Proofs, and Models in the Modal Logic K4.Tomasz Skura - 2002 - Studia Logica 70 (2):193-204.
    In this paper we study the method of refutation rules in the modal logic K4. We introduce refutation rules with certain normal forms that provide a new syntactic decision procedure for this logic. As corollaries we obtain such results for the following important extensions: S4, the provability logic G, and Grzegorczyk's logic. We also show that tree-type models can be constructed from syntactic refutations of this kind.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  14. Dowodzenie I Odrzucanie.Tomasz Skura - 2014 - Studia Philosophica Wratislaviensia 9 (4).
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  15.  19
    The RM Paraconsistent Refutation System.Tomasz Skura - 2009 - Logic and Logical Philosophy 18 (1):65-70.
    The aim of this paper is to study the refutation system consisting of the refutation axiom p ∧ ¬p → q and the refutation rules: reverse substitution and reverse modus ponens (B/A, if A → B ∈ RM). It is shown that the refutation system is characteristic for the logic of the 3-element RM algebra.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  16.  5
    Implicational Logic, Relevance, and Refutability.Tomasz Skura - forthcoming - Logic and Logical Philosophy:1.
    The goal of this paper is to analyse Implicational Relevance Logic from the point of view of refutability. We also correct an inaccuracy in our paper “The RM paraconsistent refutation system”.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Some Aspects Of Refutation Rules.Tomasz Skura - 1995 - Reports on Mathematical Logic:109-116.
    The purpose of the paper is to make a few remarks on the following aspects of refutation rules: a characteristic property of a logic, elegant and constructive completeness proofs. In particular a new constructive completeness proof for the provability logic G is given.
     
    Export citation  
     
    Bookmark   1 citation  
  18.  5
    Characterizing Propositional Logics by Formulas.Tomasz Skura - 1994 - In Jan Wolenski (ed.), Philosophical Logic in Poland. Kluwer Academic Publishers. pp. 239--245.
    Direct download  
     
    Export citation  
     
    Bookmark