12 found
Order:
  1.  16
    On the Gentzen Type Formalizations.Anita Wasilewska - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):439-444.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2.  15
    A Formalization of the Modal Propositional S4 Calculus.Anita Wasilewska - 1971 - Studia Logica 27 (1):133-147.
  3.  17
    Some Remarks on Theorem Proving Systems and Mazurkiewicz Algorithms Associated with Them.Anita Wasilewska - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (19-20):289-294.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4.  16
    Deterministic Algorithms, Simple Languages And One-to-One Gentzen Type Formalizations.Anita Wasilewska - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (10-12):181-188.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5.  11
    The Diagrams of Formulas of the Modal Propositional S4* Calculus.Anita Wasilewska - 1972 - Studia Logica 30 (1):69-76.
  6.  13
    A Sequence Formalization for SCI.Anita Wasilewska - 1976 - 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)  
     
    Export citation  
     
    My bibliography   2 citations  
  7.  14
    Programs and Logics.Anita Wasilewska - 1985 - 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)  
     
    Export citation  
     
    My bibliography  
  8.  16
    DFC-Algorithms for Suszko Logic and One-to-One Gentzen Type Formalizations.Anita Wasilewska - 1984 - 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)  
     
    Export citation  
     
    My bibliography  
  9.  13
    The Diagrams of Formulas of the Intuitionistic Propositional Calculus.Anita Wasilewska - 1973 - Studia Logica 32 (1):109 - 115.
  10.  7
    Some Remarks on Theorem Proving Systems and Mazurkiewicz Algorithms Associated with Them.Anita Wasilewska - 1985 - Mathematical Logic Quarterly 31 (19‐20):289-294.
  11.  11
    Trees and Diagrams of Decomposition.Anita Wasilewska - 1985 - 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)  
     
    Export citation  
     
    My bibliography  
  12.  1
    Deterministic Algorithms, Simple Languages And One‐to‐One Gentzen Type Formalizations.Anita Wasilewska - 1986 - Mathematical Logic Quarterly 32 (10‐12):181-188.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography