PL EN

Preferencje
Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
Czasopismo

## Banach Center Publications

1999 | 46 | 1 | 9-21
Tytuł artykułu

### Helena Rasiowa, 1917-1994

Autorzy
Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
Słowa kluczowe
Czasopismo
Rocznik
Tom
Numer
Strony
9-21
Opis fizyczny
Twórcy
autor
• Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland
autor
• Institute of Telecommunications, Szachowa 1, 04-894 Warszawa, Poland
autor
• Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland
Bibliografia
• [1] Axiomatisation d'un système partiel de la théorie de la deduction, Comptes-Rendues de la Soc. de Sci. et de Lettres de Varsovie, Cl. III (1947), 22-37.
• [2] Sur certaines matrices logiques, Comptes-Rendues de la Soc. Pol. de Math. 20 (1947), 402-403.
• [3] Sur un certain système d'axiomes du calcul des propositions, Norsk Matematisk Tiddskrift 31 (1949), 1-3.
• [4] (with R. Sikorski) A proof of the completeness theorem of Gödel, Fundamenta Mathematicae 37 (1950), 193-200.
• [5] Algebraic treatment of the functional calculi of Heyting and Lewis, Fundamenta Mathematicae 38 (1951), 99-126.
• [6] (with R. Sikorski) A proof of the Skolem-Löwenheim theorem, Fundamenta Mathematicae 38 (1951), 230-232.
• [7] A proof of the compactness theorem for arithmetical classes, Fundamenta Mathematicae 39 (1952), 8-14.
• [8] (with A. Mostowski, A. Grzegorczyk, S. Jaśkowski, J. Łoś, S. Mazur, R. Sikorski) Der gegenwärtige Stand der Grundlagenforschung in der Mathematik, Die Hauptreferate des 8. poln. Mathematikerkongresses, Warschau, Sept. 6-12, 1953 (Berlin, Deutscher Verlag der Wiss., 1954), 11-44.
• [9] (with R. Sikorski) Algebraic treatment of the notion of satisfiability, Fundamenta Mathematicae 40 (1953), 62-95.
• [10] (with A. Mostowski) Geometryczna interpretacja wyrażeń rachunków funkcyjnych ( Geometrical interpretation of expressions of functional calculi), Studia Logica 1 (1953), 254-275.
• [11] (with R. Sikorski) On satisfiability and decidability in non-classical functional calculi, Bull. Acad. Polon. de Sci., Cl. III, 1 (1953), 229-231.
• [12] (with R. Sikorski) On existential theorems in non-classical functional calculi, Fundamenta Mathematicae 41 (1954), 21-28.
• [13] Constructive theories, Bull. Acad. Polon. Sci., Cl. III, 2 (1954), 121-124.
• [14] Algebraic models of axiomatic theories, Fundamenta Mathematicae 41 (1954), 291-310.
• [15] O pewnym fragmencie implikacyjnego rachunku zdań ( On a fragment of the implicational propositional calculus), Studia Logica 3 (1955), 203-226.
• [16] (with R. Sikorski) An application of lattices to logic, Fundamenta Mathematicae 42 (1955), 83-100.
• [17] A proof of ϵ-theorems, Bull. Acad. Polon. Sci., Cl. III, 3 (1955), 299-302.
• [18] (with A. Białynicki-Birula) On the representation of quasi-Boolean algebras, Bull. Acad. Polon. Sci., Cl. III, 5 (1957), 259-261.
• [19] On the ϵ-theorems, Fundamenta Mathematicae 43 (1956), 156-165.
• [20] (with J. Łoś, A. Mostowski) A proof of Herbrand's theorem, Journ. des Math. Pures et Appl. 35 (1956), 19-24.
• [21] Sur la méthode algébrique dans la méthodologie des systèmes déductifs élémentaires, Bull. Math. de la Soc. Sci. Math. Phys. de la R. P. R., 1 (49), No. 2 (1957), 223-231.
• [22] (with R. Sikorski) On the isomorphisms of Lindenbaum algebras with fields of sets, Colloquium Mathematicum V (1958), 143-158.
• [23] N-lattices and constructive logic with strong negation, Fundamenta Mathematicae 46 (1958), 61-80.
• [24] (with A. Białynicki-Birula) On constructible falsity in the constructive logic with strong negation, Colloquium Mathematicum VI (1958), 287-310.
• [25] Algebraische Charakterisierung der intuitionistischen Logik mit starker Negation, in: Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics (Amsterdam, North-Holland, 1959), 234-240.
• [26] (with R. Sikorski) Formalisierte intuitionistische elementäre Theorien, in: Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics (Amsterdam, North-Holland, 1959), 241-249.
• [27] (with R. Sikorski) On the Gentzen theorem, Fundamenta Mathematicae 48 (1960), 57-69.
• [28] (with J. Łoś, A. Mostowski) Addition au travail A proof of Herbrand's theorem', Journ. des Math. Pures et Appl. 40 (1961), 129-134.
• [29] On modal theories, Acta Philosophica Fennica, Fasc. XVI (1963), 201-214.
• [30] (edited by H. Rasiowa and A. Mostowski) Computable analysis, Stanisław Mazur, Rozprawy Matematyczne, 33, 1963, 110 pp.
• [31] (with R. Sikorski) The mathematics of metamathematics, Monografie Matematyczne 41, PWN, 1963, 519 pp.; 2nd edition 1968, 3rd edition 1970.
• [32] Logika matematyczna ( Mathematical Logic), in: Encyklopedia Przyroda i technika'', Wiedza Powszechna 1964, pp. 610-615; 2nd edition 1967, pp. 655-659.
• [33] A generalization of a formalized theory of fields of sets on non-classical logics, Rozprawy Matematyczne 42 (1964), 29 pp.
• [34] On non-classical calculi of classes, Coll. on the Foundations of Mathematics, Mathematical Machines and their Applications, Tihany, Sept. 11-15, 1962, (Budapest, Akademiai Kiado, 1965), 53-55.
• [35] Wstęp do Logiki Matematycznej i Teorii Mnogości ( Introduction to Mathematical Logic and Set Theory), Bibl. Kursów Zastosowań Matematyki, Inst. Matem. PAN, 1966, 166 pp.
• [36] O wykładzie Wstęp do Matematyki ( On the course Introduction to Mathematics'), Wiadomości Matematyczne IX (1967), 240-243.
• [37] Wstęp do matematyki współczesnej ( Introduction to modern mathematics), Bibl. Matematyczna 30, PWN, 1968, 302 pp.; 2nd edition 1969, 3rd edition 1971, 4th edition 1974, 5th edition 1975, 6th edition 1977, 7th edition 1979, 8th edition 1984.
• [38] Introduction to modern mathematics (in Bulgarian), Nauka i Iskustvo, Sofia, 1972.
• [39] A theorem on the existence of prime filters in Post algebras and the completeness theorem for some many valued predicate calculi, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 17 (1969), 347-354.
• [40] Ultraproducts of m-valued models and a generalization of the Löwenheim-Skolem-Gödel-Malcev theorem for theories based on m-valued logics, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 18 (1970), 415-420.
• [41] The Craig interpolation theorem for m-valued predicate calculi, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 20 (1972), 141-146.
• [42] On logical structure of programs, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 20 (1972), 319-324.
• [43] On algorithmic logic, Abstracts of 1971 Meeting on Computational Linguistics, Debrecen, Yugoslavia, Sept. 4-7, 1971.
• [44] On m-valued predicate calculi, Abstracts IV International Congress for Logic, Methodology and Philosophy of Science, Bucarest, Romania, August 29 - Sept. 4, 1971, Vol. 44.
• [45] (with R. Sikorski) The mathematics of metamathematics (in Russian), Izdatelstvo Nauka, Moscow, 1972.
• [46] Roman Sikorski, Nauka Polska 20, zesz. 4 (1972), 70-75.
• [47] Introduction to modern mathematics, North-Holland and American Elsevier, 1973, 326 pp.
• [48] Introduction to modern mathematics, PWN and North-% Holland, 1973, 326 pp.
• [49] An algebraic approach to non-classical logics, Studies in Logic and the Foundations of mathematics, Vol. 78, North-Holland 1974, 403 pp.
• [50] Post algebras as a semantic foundation of m-valued logics, The Mathematical Association of America Studies in Mathematics, Vol. 9, 1974, 92-142.
• [51] On a logical structure of programs, Proc. Intern. Symp. and Summer School on Math. Foundations of Comp. Sci., Jabłonna, August 21-26, 1972, CC PAS Reports.
• [52] On generalized Post algebras of order $ω^+$ and $ω^+$-valued predicate calculi, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 21 (1973), 209-219.
• [53] On logical structure of mix-valued programs and the $ω^+$ valued algorithmic logic, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 21 (1973), 451-458.
• [54] Formalized $ω^+$-valued algorithmic systems, Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 21 (1973), 559-565.
• [55] Mixed-valued predicate calculi, Studia Logica 34 (1975), 215-234.
• [56] On $ω^+$-valued algorithmic logic and related problems, Invited lecture, MFCS'73, High Tatra, CCPAS Reports 150, 1974.
• [57] A simplified formalization of $ω^+$-valued algorithmic logic (a formalized theory of programs), Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 22 (1974), 595-603.
• [58] Extended $ω^+$-valued algorithmic logic (a formalized theory of programs with recursive procedures), Bull. Acad. Polon. Sci., Série Sci. Math. Astr. Phys. 22 (1974), 605-610.
• [59] $ω^+$-valued algorithmic logic as a tool to investigate procedures, Invited lecture, MFCS'74, Warszawa-Jadwisin, Lect. Notes in Comp. Sci. 28, Proceed. MFCS'74, Springer-Verlag, 1975.
• [60] Many-valued algorithmic logic, Invited lecture, Proceed. Intern. Summer Institute and Logic Colloquium, Kiel 1974, Lect. Notes in Mathem. 499, (Berlin/Heidelberg/New York, Springer-Verlag, 1975), 543-567.
• [61] Multiple-valued algorithmic logic as a tool to investigate programs, Invited lecture, 1975 Intern. Symp. on Multiple-Valued Logic, Indiana Univ., Bloomington, USA, May 25-28, 1975, Proceedings, 1-3.
• [62] Completeness theorem for extended algorithmic logic, Proceed. 5th Congress of Logic, Methodology and Philosophy of Sciences, London, Ontario, August 27 - Sept. 2, 1975, III, 13-15.
• [63] Algorithmic logic, Lecture Notes, Lectures delivered at Simon Fraser Univ., May-July 1975, ICS PAS Reports 281 (Warsaw), 1977, 206 pp.
• [64] (with L. Banachowski, A. Kreczmar, G. Mirkowska, A. Salwicki) An introduction to algorithmic logic, Banach Center Publications, Vol. 2, (Warszawa, PWN, 1977), 7-99.
• [65] Andrzej Mostowski (1913-1975), Nauka Polska 9-10 (1976), 233-237.
• [66] Andrzej Mostowski, The review of the Polish Academy of Science, 1976, No. 4.
• [67] A tribute to Andrzej Mostowski, Invited paper, in R. O. Gandy and J. M. E. Hyland (editors), Logic Colloquium'76 (Amsterdam/London, North-Holland, 1977), 139-144.
• [68] In memory of Andrzej Mostowski, Studia Logica 36, No. 1-2 (1977), 1-3.
• [69] Many-valued algorithmic logic as a tool to investigate programs, in: G. Epstein and J. M. Dunn (editors), Modern Uses of Multiple-Valued Logic ISMVL'75 (Dordrecht, Reidel, 1977), 77-102.
• [70] Algorithmic logic and its extensions, a survey, Invited paper, Proceed. of the 5th Scandinavian Logic Symposium, Aalborg, January 17-19, 1979, 163-174.
• [71] Algorithmic logic, multiple-valued extensions, Invited paper, Intern. Symp. on Practical and Philosophical Motivations of Non-classical Logics, Studia Logica 38 (1979), 317-335.
• [72] Infinitary logic and logics of programs, Raccolta a Cura di Gianfranco Mascari, Istituto per le Aplicazioni del Calcolo, Consiglio Nazionale delle Ricerche, 1982, Rome, Italy.
• [73] Topological representations of Post algebras of order $ω^+$ and open theories based on $ω^+$-valued Post logic, Studia Logica XLIV, No. 4, 1985.
• [74] (with A. Skowron) Rough concept logic, Proceed. 5th Symp. on Computation Theory, LNCS 208 (Springer-Verlag 1985), 288-297.
• [75] (with A. Skowron) Approximation logic, in: Math. Methods of Specification and Synthesis of Software Systems, W. Bibel and K. P. Jantke (editors), Math. Research 31 (Berlin, Akademie-Verlag, 1985), 123-139.
• [76] (with W. Marek) Approximating sets with equivalence relations, Theoretical Computer Science 48 (1986), 145-152.
• [77] (with W. Marek) Approximating sets with equivalence relations, in: Proceed. ISMIS'86, Knoxville, Tenn., 1986, ACM SIGART, 190-200.
• [78] Rough concepts and multiple-valued logic, Proceed. 16th ISMVL'86, Blacksburg, VA, 1986 (IEEE Computer Society Press), 282-288.
• [79] (with G. Epstein) P-algebraic extensions of Post algebras of order $ω^+$, in: Proceed. ISMVL'86, Blacksburg, VA, 1986 (IEEE Computer Society Press), 4-7.
• [80] Logic approximating sequences of sets, in: Proceed. Advanced Intern. School and Symp. on Math. Logic and its Applications, honorably dedicated to 80th anniversary of Kurt Gödel, (New York, Plenum Press, 1987), 167-186.
• [81] (with W. Marek) Gradual approximating sets by means of equivalence relations, Bull. Pol. Acad. Sci., Math. 35, No. 3-4 (1987), 233-238.
• [82] (with G. Epstein) Approximation reasoning and Scott's information systems, in: Z. Raś and M. Zemankova (editors), Methodologies for Intelligent Systems, Proceed. 2nd ISMIS'87, Charlotte, N.C., October 14-17, 1987, (Amsterdam/New York/Oxford, North-Holland, 1987), 33-42.
• [83] An algebraic approach to some approximate reasonings, in: Proceed. 17th ISMVL'87, Boston, MA, May 24-26, 1987 (IEEE Computer Society Press), 342-347.
• [84] (with Nguyen Cat Ho) Semi-Post algebras, Studia Logica 46, No. 2 (1987), 147-158.
• [85] (with Nguyen Cat Ho) Subalgebras and homomorphisms of semi-Post algebras, Studia Logica 46, No. 2 (1987), 159-173.
• [86] Logic of approximation reasoning, Proceed. 1st Workshop on Computer Science Logic, Karlsruhe, Germany, 1987, LNCS 239, (Berlin, Springer-Verlag, 1988), 188-210.
• [87] Mathematical problems in computation theory, eds. G. Mirkowska, H. Rasiowa, Proceed. 26th Semester at the Banach International Center, Warsaw, Sept. 16 - Dec. 14, 1985, Banach Center Publications 21, 1988, 597 pp.
• [88] (with W. Marek) On reaching consensus by groups of intelligent agents, in: Z. W. Raś (editor), Methodologies for Intelligent Systems 4, Proceed. ISMIS'89 (Amsterdam/New York/Oxford, North-Holland, 1989), 234-243.
• [89] (with Nguyen Cat Ho) Plain semi-Post algebras as a poset-based generalization of Post algebras and their representability, Studia Logica 48, No. 4, (1989).
• [90] (with G. Epstein) Theory and uses of Post algebras of order ω+ω*, in: Proceed. ISMVL'90, Charlotte, N. C., May 23-25, 1990, IEEE Computer Society Press, 42-47.
• [91] On approximation logics, a survey, Jahrbuch 1990, Kurt Gödel Gessellschaft, Vienna, Austria, 1990, 63-87.
• [92] Mechanical proof systems for logic of reaching consensus by groups of intelligent agents, Intern. Journ. of Approximate Reasoning 5, No. 4 (1991), 415-432.
• [93] (with W. Marek) Mechanical proof systems for logic II, consensus programs and their processing, Journ. of Intelligent Information Systems 2, No. 2 (1992), 149-164.
• [94] (with Nguyen Cat Ho) LT-fuzzy sets, Intern. Journ. on Fuzzy Sets and Systems 47, No. 3 (1992), 233-339.
• [95] Towards fuzzy logic, in: L. A. Zadeh and J. Kacprzyk (editors), Fuzzy Logic for Management of Uncertainty, (New York, John Wiley & Sons, 1992), 5-25.
• [96] (with Nguyen Cat Ho) LT-fuzzy logics, in: L. A. Zadeh and J. Kacprzyk (editors), Fuzzy Logic for Management of Uncertainty, (New York, John Wiley & Sons, 1992), 121-139.
• [97] Axiomatization and completeness of uncountably valued approximation logic, Studia Logica 53, No. 1 (1994), 137-160.
Typ dokumentu
Bibliografia
Identyfikatory
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.2504420280456543, "perplexity": 16321.500063161977}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547583690495.59/warc/CC-MAIN-20190120021730-20190120043730-00388.warc.gz"}