11 found
Sort by:
  1. Anita Wasilewska (1986). Deterministic Algorithms, Simple Languages And One‐to‐One Gentzen Type Formalizations. Mathematical Logic Quarterly 32 (10‐12):181-188.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Anita Wasilewska (1985). Programs and Logics. Studia Logica 44 (2):125 - 137.
    We use the algebraic theory of programs as in Blikle [2], Mazurkiewicz [5] in order to show that the difference between programs with and without recursion is of the same kind as that between cut free Gentzen type formalizations of predicate and prepositional logics.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Anita Wasilewska (1985). Some Remarks on Theorem Proving Systems and Mazurkiewicz Algorithms Associated with Them. Mathematical Logic Quarterly 31 (19‐20):289-294.
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Anita Wasilewska (1985). Trees and Diagrams of Decomposition. Studia Logica 44 (2):139 - 158.
    We introduce here and investigate the notion of an alternative tree of decomposition. We show (Theorem 5) a general method of finding out all non-alternative trees of the alternative tree determined by a diagram of decomposition.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Anita Wasilewska (1984). DFC-Algorithms for Suszko Logic and One-to-One Gentzen Type Formalizations. Studia Logica 43 (4):395 - 404.
    We use here the notions and results from algebraic theory of programs in order to give a new proof of the decidability theorem for Suszko logic SCI (Theorem 3).We generalize the method used in the proof of that theorem in order to prove a more general fact that any prepositional logic which admits a cut-free Gentzen type formalization is decidable (Theorem 6).
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Anita Wasilewska (1980). On the Gentzen Type Formalizations. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):439-444.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Anita Wasilewska (1976). A Sequence Formalization for SCI. Studia Logica 35 (3):213 - 217.
    This paper can be treated as a simplification of the Gentzen formalization of SCI-tautologies presented by A. Michaels in [1].
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  8. Anita Wasilewska (1973). The Diagrams of Formulas of the Intuitionistic Propositional Calculus. Studia Logica 32 (1):109 - 115.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. Anita Wasilewska (1972). The Diagrams of Formulas of the Modal Propositional S4* Calculus. Studia Logica 30 (1):69 - 78.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  10. Anita Wasilewska (1972). The Diagrams of Formulas of the Modal Propositional $\Text{S}4^{\Ast}$ Calculus. Studia Logica 30 (1):69 - 78.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. Anita Wasilewska (1971). A Formalization of the Modal Propositional S4 Calculus. Studia Logica 27 (1):133 - 149.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation