27 found
Order:
  1.  24
    An Algebraic Approach to Non-Classical Logics.Helena Rasiowa - 1974 - Warszawa, Pwn - Polish Scientific Publishers.
  2.  17
    The Mathematics of Metamathematics.Helena Rasiowa - 1963 - Warszawa, Państwowe Wydawn. Naukowe.
    Direct download  
     
    Export citation  
     
    My bibliography   138 citations  
  3.  9
    Plain Semi-Post Algebras as a Poset-Based Generalization of Post Algebras and Their Representability.Nguyen Cat Ho & Helena Rasiowa - 1989 - Studia Logica 48 (4):509 - 530.
    Semi-Post algebras of any type T being a poset have been introduced and investigated in [CR87a], [CR87b]. Plain Semi-Post algebras are in this paper singled out among semi-Post algebras because of their simplicity, greatest similarity with Post algebras as well as their importance in logics for approximation reasoning ([Ra87a], [Ra87b], [RaEp87]). They are pseudo-Boolean algebras generated in a sense by corresponding Boolean algebras and a poset T. Every element has a unique descending representation by means of elements in a corresponding (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  4.  14
    O Pewnym Fragmencie Implikacyjnego Rachunku Zdań.Helena Rasiowa - 1955 - Studia Logica 3 (1):208 - 226.
  5.  4
    Subalgebras and Homomorphisms of Semi-Post Algebras.Nguyen Cat Ho & Helena Rasiowa - 1987 - Studia Logica 46 (2):161 - 175.
    Semi-Post algebras have been introduced and investigated in [6]. This paper is devoted to semi-Post subalgebras and homomorphisms. Characterization of semi-Post subalgebras and homomorphisms, relationships between subalgebras and homomorphisms of semi-Post algebras and of generalized Post algebras are examined.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  6.  16
    Recenzje.S. Łuszczewska-Romahnowa, Helena Rasiowa, Stanisław Kamiński & Laudwik Borkowski - 1958 - Studia Logica 8 (1):319-333.
  7.  21
    O Geometrycznej Interpretacji Wyrażeń Logicznych.Helena Rasiowa & Andrzeij Mostowski - 1953 - Studia Logica 1 (1):254 - 275.
  8.  8
    Topological Representations of Post Algebras of Order Ω+ and Open Theories Based on Ω+-Valued Post Logic.Helena Rasiowa - 1985 - Studia Logica 44 (4):353 - 368.
    Post algebras of order + as a semantic foundation for +-valued predicate calculi were examined in [5]. In this paper Post spaces of order + being a modification of Post spaces of order n2 (cf. Traczyk [8], Dwinger [1], Rasiowa [6]) are introduced and Post fields of order + are defined. A representation theorem for Post algebras of order + as Post fields of sets is proved. Moreover necessary and sufficient conditions for the existence of representations preserving a given set (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  9.  19
    On a Fragment of the Implicative Propositional Calculus.Helena Rasiowa - 1955 - Studia Logica 3 (1):225-226.
  10.  17
    Cecylia Rauszer.Helena Rasiowa - 1994 - Studia Logica 53 (4):467 - 471.
  11.  17
    A Partially Ordered Extention of the Integers.George Epstein & Helena Rasiowa - 1995 - Studia Logica 54 (3):303 - 332.
    This paper presents a monotonic system of Post algebras of order +* whose chain of Post constans is isomorphic with 012 ... -3-2-1. Besides monotonic operations, other unary operations are considered; namely, disjoint operations, the quasi-complement, succesor, and predecessor operations. The successor and predecessor operations are basic for number theory.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  12.  17
    On Logic of Complex Algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
    An algebraic approach to programs called recursive coroutines — due to Janicki [3] — is based on the idea to consider certain complex algorithms as algebraics models of those programs. Complex algorithms are generalizations of pushdown algorithms being algebraic models of recursive procedures (see Mazurkiewicz [4]). LCA — logic of complex algorithms — was formulated in [11]. It formalizes algorithmic properties of a class of deterministic programs called here complex recursive ones or interacting stacks-programs, for which complex algorithms constitute mathematical (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  13.  14
    Algorithmic Logic. Multiple-Valued Extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
    Extended algorithmic logic (EAL) as introduced in [18] is a modified version of extended +-valued algorithmic logic. Only two-valued predicates and two-valued propositional variables occur in EAL. The role of the +-valued logic is restricted to construct control systems (stacks) of pushdown algorithms whereas their actions are described by means of the two-valued logic. Thus EAL formalizes a programming theory with recursive procedures but without the instruction CASE.The aim of this paper is to discuss EAL and prove the completeness theorem. (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  14.  9
    Semi-Post Algebras.Nguyen Cat Ho & Helena Rasiowa - 1987 - Studia Logica 46 (2):149 - 160.
    In this paper, semi-Post algebras are introduced and investigated. The generalized Post algebras are subcases of semi-Post algebras. The so called primitive Post constants constitute an arbitrary partially ordered set, not necessarily connected as in the case of the generalized Post algebras examined in [3]. By this generalization, semi-Post products can be defined. It is also shown that the class of all semi-Post algebras is closed under these products and that every semi-Post algebra is a semi-Post product of some generalized (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  15.  19
    A Geometric Interpretation of Logical Formulae.Helena Rasiowa & Andrze Mostowski - 1953 - Studia Logica 1 (1):273-275.
    The aim of this paper is to give a geometric interpretation of quantifiers in the intutionistic predicate calculus. We obtain it treating formulae withn free variables as functions withn arguments which run over an abstract set whereas the values of functions are open subsets of a suitable topological space.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  16.  13
    In Memory of Andrzej Mostowski.Helena Rasiowa & Wiktor Marek - 1977 - Studia Logica 36 (1-2):1 - 8.
  17.  14
    Mixed-Valued Predicate Calculi.Helena Rasiowa - 1975 - Studia Logica 34 (3):215 - 234.
  18.  17
    Axiomatization and Completeness of Uncountably Valued Approximation Logic.Helena Rasiowa - 1994 - Studia Logica 53 (1):137 - 160.
    A first order uncountably valued logic ${\bf \text{L}}_{{\bf \text{Q}}_{}}$ for management of uncertainty is considered. It is obtained from approximation logics $\text{L}_{\text{T}}$ of any poset type by assuming = Q, ≤) -- where Q is the set of all rational numbers q such that 0 < q < 1 and ≤ is the arithmetic ordering -- by eliminating modal connectives and adopting a semantics based on LT-fuzzy sets. Logic ${\bf \text{L}}_{{\bf \text{Q}}_{}}$ can be treated as an important case of LT-fuzzy (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  19.  2
    Review: B. U. Pil'cak, On the Decision Problem for the Calculus of Problems. [REVIEW]Helena Rasiowa - 1951 - Journal of Symbolic Logic 16 (3):226-227.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20.  2
    Review: Eugen Gh. Mihailescu, Researches on Sub-Systems of the Propositional Calculus. [REVIEW]Helena Rasiowa - 1952 - Journal of Symbolic Logic 17 (4):277-278.
    Direct download  
     
    Export citation  
     
    My bibliography  
  21.  1
    Introduction to Modern Mathematics.Helena Rasiowa & Olgierd Wojtasiewicz - 1978 - Journal of Symbolic Logic 43 (1):153-154.
  22. Mihailescu Eugen Gh.. Cercetǎri Asupra Subsistemelor Calculului Propoziţiilor . Roumanian, with Abstracts in Russian and French. Studii Şi Cercetӑri Matematice, Academia Republicii Populate Romane, Institutul de Matematica, Vol. 2 , Pp. 1–44. [REVIEW]Helena Rasiowa - 1952 - Journal of Symbolic Logic 17 (4):277-278.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23. Pil'čak B. Ú.. O problémé razréšimosti dlá isčisléniá zadač Doklady Akadémii Nauk SSSR, vol. 75 , pp. 773–776.Helena Rasiowa - 1951 - Journal of Symbolic Logic 16 (3):226-227.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  24. Pil'čak B. Ú.. Ob Isčislénii Zadač . Ukrainskij Matématičéskij Žurnal, Vol. 4 , Pp. 174–194.Helena Rasiowa - 1956 - Journal of Symbolic Logic 21 (4):372.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25. Review: B. U. Pil'cak, On the Calculus of Problems. [REVIEW]Helena Rasiowa - 1956 - Journal of Symbolic Logic 21 (4):372-372.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26. Review: Roman Sikorski, A Note to Rieger's Paper "On Free $Aleph_xi$-Complete Boolean Algebras.". [REVIEW]Helena Rasiowa - 1954 - Journal of Symbolic Logic 19 (4):287-287.
  27. Sikorski Roman. A Note to Rieger's Paper “On Free ℵξ-Complete Boolean Algebras.” Fundamenta Mathematicae, Vol. 38 , Pp. 53–54. [REVIEW]Helena Rasiowa - 1954 - Journal of Symbolic Logic 19 (4):287.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography