61. AARNEWS - May 2005 An international conference in memoriam for A. Mostowski, H. rasiowa, gather the former students and collaborators of Andrzej Mostowski, helena rasiowa, http://www.mcs.anl.gov/AAR/issuemay05/

A SSOCIATION FOR A UTOMATED ... EASONING NEWSLETTER No. 67, May 2005 From the AAR President Davis to Receive 2005 Herbrand Award Woody Bledsoe Student Travel Award: Call for Nominations Call for Nominations: CADE Trustees Election ... CADE ATP System Competition Call for Papers Trends in Logic III LPAR-12 FLoC'06 Call for Abstracts of Theses From the AAR President, Larry Wos... My congratulations to Martin Davis as winner of this year's Herbrand Award! The progress in the field of automated reasoning in the past 40 years is amazing, and contributions such as Martin's deserve to be acknowledged. I encourage AAR members to participate in the CASC competition. This is one way to demonstrate how much our automated reasoning programs have advanced. Of course, I cannot resist the opportunity to also encourage you to attack open questions in various fields. Davis to Receive 2005 Herbrand Award Franz Baader President of CADE Inc. It is my distinct honor to announce on behalf of the Board of Trustees of CADE Inc. that Martin Davis is to receive the 2005 Herbrand Award for Distinguished Contributions to Automated Reasoning in recognition of his role as a founding father of the field of automated reasoning;

62. Selected Publications By Stéphane Demri Essays Dedicated to the Memory of helena rasiowa, Studies in Fuzziness and SoftComputing 24, chapter 22, pages 383409. Physica Verlag, 1999. http://www.lsv.ens-cachan.fr/~demri/mes-publis.php?onlykey=Demri::Orlowska98c

63. Selected Publications By Stéphane Demri Essays Dedicated to the Memory of helena rasiowa, Studies in Fuzziness and SoftComputing 24, chapter 22, pages 383409. Physica Verlag, 1999. ( BibTeX ) http://www.lsv.ens-cachan.fr/~demri/mes-publis.php

Selected publications by S. Demri A reduction from DLP to PDL Journal of Logic and Computation , 2005. To appear. ( PDF BibTeX S. Demri and D. Nowak Reasoning about infinite sequences (extended abstract) In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), Taipei, Taiwan, ROC, October 2005, LNCS 3707. Springer. To appear. ( PS PDF BibTeX S. Demri and R. Gascon Verification of Qualitative Z -Constraints In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), San Francisco, CA, USA, August 2005, LNCS 3653, pages 518-532. Springer. ( PDF PS (long version) PDF (long version) BibTeX ... S. Demri and H. de Nivelle Deciding Regular Grammar Logics with Converse through First-Order Logic Journal of Logic, Language and Information 14(3), pages 289-319, 2005. ( PDF BibTeX S. Demri , R. Lazic and D. Nowak On the Freeze Quantifier in Constraint LTL: Decidability and Complexity In Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME'05), Burlington, Vermont, USA, June 2005, pages 113-121. IEEE Computer Society Press. ( PS PDF BibTeX S. Demri

64. June 2005 helena rasiowa, 21 Siméon Denis Poisson, 22 Konrad Zuse, 23 Alan Turing, 24 OswaldVeblen, 25 Willard Van Quine. 26 William Thomson, 27 http://mathforum.org/~judyann/calendar/June2005.html

June 2005 Can you identify the pictured Mathematicians? Sunday Monday Tuesday Wednesday Thursday Friday Saturday Eduard Helly Paul Mansion John Henry Pratt John Maynard Keynes Max Zorn Edward Van Vleck Charlotte Angas Scott John Edensor Littlewood Vladimir Smirnov Zygmunt Janiszewski John F Nash Andrei Andreyevich Markov Nikolai Chebotaryov Maurits Cornelius Escher Arthur Russell Forsyth Blaise Pascal Helena Rasiowa Konrad Zuse Alan Turing Oswald Veblen Willard Van Quine William Thomson Augustus De Morgan Carl Einar Hille Witold Hurewicz Karl Rudolf Fueter A quotation for June: John Maynard Keynes (1883 - 1946) I can't remember my telephone number, but I know it was in the high numbers. Quoted in D MacHale, Comic Sections (Dublin 1993) This calendar is available in a printable PDF format. Back to calendar page.

65. June 2004 helena rasiowa, 21 Siméon Denis Poisson, 22 Konrad Zuse, 23 Alan Turing, 24 OswaldVeblen, 25 Willard Van Quine, 26 William Thomson http://mathforum.org/~judyann/calendar/June2004.html

June 2004 Can you identify the pictured Mathematicians? Sunday Monday Tuesday Wednesday Thursday Friday Saturday Eduard Helly Paul Mansion John Henry Pratt John Maynard Keynes Max Zorn Edward Van Vleck Charlotte Angas Scott John Edensor Littlewood Vladimir Smirnov Zygmunt Janiszewski John F Nash Andrei Andreyevich Markov Nikolai Chebotaryov Maurits Cornelius Escher Arthur Russell Forsyth Blaise Pascal Helena Rasiowa Konrad Zuse Alan Turing Oswald Veblen Willard Van Quine William Thomson Augustus De Morgan Carl Einar Hille Witold Hurewicz Karl Rudolf Fueter A quotation for June: John Maynard Keynes (1883 - 1946) I can't remember my telephone number, but I know it was in the high numbers. Quoted in D MacHale, Comic Sections (Dublin 1993) This calendar is available in a printable PDF format. Back to calendar page.

66. Robert Kowalski I took courses with helena rasiowa, Andrzej Grzegorczyk and Andrzej Mostowski.I spent much of my time on extracurricular activities. http://www-lp.doc.ic.ac.uk/UserPages/staff/rak/history.html

67. Tempmos Online Essays Dedicated to the Memory of {helena} {rasiowa} , editor= E. Orlowska ,series = Studies in Fuzziness and Soft Computing , volume= 24 , http://www.csse.uwa.edu.au/~mark/research/Online/Tempmos.htm

Other papers online The Mosaic Method for Temporal Logics Maarten Marx Szabolcs Mikulas and Mark Reynolds Abstract The aim of this paper is to apply the so called mosaic method for proving decidability, Hilbert-style (strong) completeness and tableau (weak) completeness. The mosaic method was invented by István Németi to prove decidability of the equational theories of certain classes of algebras of relations, cf. . The idea is to show that the existence of a model is equivalent to the existence of a finite set of partial models, called mosaics. This gives us a decision procedure, and, intuitively, a systematic procedure to check the theoremhood of a certain formula. Recently the mosaic method has been applied to prove decidability, Hilbert-style axiomatizability and complexity results for various modal logics, cf., e.g., [HHMMR] , and [vene:moda96] In this paper, we try to make explicit the connection between the mosaic method and tableau systems. Using the original idea of a mosaic decidability proof we will define a complete tableau systems for linear temporal logic. This seems to be a new result, since we will not assume anything about the linear order. We will also prove completeness and decidability. These results are well known, but we think using mosaics the proofs become much simpler. In the last section we will show how to modify the method to obtain similar results for special linear flows of time, e.g., discrete, dense, with or without endpoints, substructures of whole numbers.

68. In-cites - University Of Warsaw the great mathematicians, the successors of the Polish mathematical schoolKazimierz Kuratowski, Stanislaw Mazur, Hugo Steinhaus, and helena rasiowa. http://www.in-cites.com/institutions/UniversityofWarsaw.html

S E A R C H in cites INSTITUTIONS Scientists Papers Institutions Journals ... Hot Papers published within the last 2 years Current Classics What's New in Research H O M E Methods for ISI Essential Science Indicators ISI Essential Science Indicators Latest Version Classification of Papers in Multidisciplinary Journals New Entrants to ... About in cites Browse Back Issues Send in cites to a Colleague ISI Contact Us in cites is an editorial component of ISI Essential Science Indicators from ISI View the ISI Essential Science Indicators Product Tour in-cites, June 2004 Citing URL: http://www.in-cites.com/institutions/UniversityofWarsaw.html University of Warsaw ate in 2003, the University of Warsaw entered the top 1% of institutions in terms of total citations in the field of Computer Science. According to the ISI Essential Science Indicators Web product, the institution’s current citation record in this field includes 227 papers cited a total of 499 times to date. In the brief interview below, Damian Niwinski, Vice-Director of the Institute of Informatics at the University of Warsaw, talks about the history of Computer Science at the university.

69. Kamal Lodaya - Reviews - Modal Logic lament over the neglect of algebra in modal logic, only a single mention ismade of the work of helena rasiowa, Roman Sikorski and their Polish school. http://www.imsc.res.in/~kamal/ml.html

Patrick Blackburn, Maarten de Rijke and Yde Venema. Modal Logic Cambridge University Press, 2001, 576 Pages, ISBN 0-521-80200-8 ACM CR category: F.4.1 Modal logic This is a book on modal logic as it was in the 1980s, when this reviewer wrote his dissertation (and probably when the authors did as well). In the '90s, I worked on modal logics to describe behaviour of computational structures. While reviewing this book, I wondered what it would have been like to have it around at that time. The authors express their annoyance with the view that modal logic amounts to rather simple-minded uses of two operators Diamond and Box . Instead they concentrate on more general results, and to the connection of modal logic to first-order logic, algebra and computational complexity. Although the blurb says prior acquaintance with first-order logic and its semantics is assumed, I would go further and demand prior acquaintance with the model theory of first-order logic. Ultrafilters, ultraproducts and ultrapowers pop up everywhere and if you don't know how they work, the book might seem a bit intimidating. I think the book has a definite audience among logicians, but I want to focus upon the utility for computer scientists. I liked the treatment of bisimulation in the Models chapter, but was baulked by the constant reference to first-order logic.

70. Fuzzy Archive: IEEE ISMVL '96 Preliminary Program 0900 1045 SPECIAL SESSION helena rasiowa. In memoriam Invited Speakers On the contributions of helena rasiowa to Mathematical Logic http://www.dbai.tuwien.ac.at/marchives/fuzzy-mail96/0374.html

IEEE ISMVL '96 Preliminary Program ISMVL '96 Local Org. Comm. elieee@usc.es Wed, 17 Apr 1996 19:53:03 +0200 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Next message: Michael Lee: "SPECIAL BISC Seminar, MONDAY 22 April 1996, 320 Soda, 4-5:00pm" Previous message: Andrew_R._Mitz: "Looking for fuzzy programmer. No money (yet)" The Multiple-valued Logic Technical Committee of the IEEE Computer Society will hold its 26th. annual symposium on May 29 - 31, 1996 in Santiago de Compostela, Spain. The symposium will be sponsored by the University of Santiago de Compostela, the Commission for the 5th. Centennial Anniversary of the University of Santiago de Compostela and by the IEEE Computer Society. The symposium will be co-sponsored by the General Direction of Scientific and Technical Research (Spanish Ministry of Education and Science), the honorable Council of Santiago de Compostela and the Government of Galicia. The University of Santiago de Compostela will host the Symposium on its South campus, located in the new part of the city, very close to the old town. The

71. PSIgate - Physical Sciences Information Gateway Search/Browse Results helena rasiowa Born 20 June 1917 in Vienna, Austria Died 9 Aug 1994 in Warsaw,Poland Click the picture above to see two larger pictures Show birthplace http://www.psigate.ac.uk/roads/cgi-bin/search_webcatalogue2.pl?limit=1700&term1=

72. Contents, Volume 5 Wiktor BARTOL, Ewa ORLOWSKA Andrzej SKOWRON, helena rasiowa, 1917 1994, ModernLogic 5 (1995), 231 - 247. Biographical sketch and discussion of http://homepages.ed.ac.uk/pmilne/ml/abs5.html

Modern Logic Contents and abstracts for Modern Logic Volume 5 Vol. 5, no. 1 Vol. 5, no. 2 Vol. 5, no. 3 Vol. 5, no. 4 Modern Logic /1, January 1995 Studies in the Nineteenth-century History of Algebraic Logic and Universal Algebra: A Secondary Bibliography Modern Logic This bibliography lists all the nineteenth and twentieth century secondary materials on the nineteenth century history of algebraic logic, universal algebra and closely related topics, including lattice theory known to the compilers up to the time of printing. Also included are secondary studies on such areas as linear and multilinear algebra and what in the early nineteenth century such British algebraists as George Peacock and Charles Babbage called "symbolical algebra" which had an influence on the research in logic of such men as Boole, Charles Peirce, Schroeder, and Whitehead, among others. The bibliography lists approximately 1400 items. Modern Logic /2, April 1995 Benjamin S. HAWKINS, Jr. De Morgan, Victorian syllogistic and relational logic Modern Logic Historical analysis of the work in logic of Augustus De Morgan is set within the context of the Victorian scientific, intellectual and cultural milieu. De Morgan's concepts of formal logic and formal systems are analyzed, and a contrast is drawn between Victorian and modern aspects of De Morgan's work. The origins of De Morgan's Laws are noted as is his work in the logic of relations. The study includes a review of Daniel Merrill's book

73. Csuhaj-Varjú Erzsébet helena rasiowa in memoriam . Minisemester, Stefan Banach International MathematicalCenter, Warsaw, 1996. december 12. (meghívott elõadó) http://www.sztaki.hu/~csuhaj/e-talks_m.html

Az utóbbi években tartott elõadások Descriptional Complexity Issues in Grammar Systems. Descriptional Complexity of Formal Systems. 4th Workshop, 2002. augusztus 21-24, London, Ontario, Canada. ( meghívott tutorial Networks of language processors:bio-inspired models of computing. Workshop "Structural questions in neural networks". Computational Neuroscience Group, Research Institute for Particle and Nuclear Physics, Hungarian Academy of Sciences. 2002. július 1-3. ( meghívott elõadó P-automata. Workshop of the European Molecular Computing Consortium, 2002. május 10-11, Metz. Watson-Crick D0L rendszerek hálózatai. A Számítástudomány Alapjai Tanszék, Szegedi Egyetem, 2002. március 26. On networks of Watson-Crick D0L systems. Institute of Informatics. Silesian University at Opava, Opava, 2001. november 26. Networks of Watson-Crick D0L systems. Department of Informatics. University of Potsdam, 2001. október 15. On the number of rules in components of cooperating distributed grammar systems with probabilities. Third International Workshop DCAGRS'2001, Bécs, 2001. július 21. Pipeline systems. Workshop of the European Molecular Computing Consortium, Madrid, 2001, május 11.

74. Erzsébet Csuhaj-Varjú helena rasiowa in memoriam . Minisemester, Stefan Banach International MathematicalCenter, Warsaw, December 12, 1996. (invited speaker) http://www.sztaki.hu/~csuhaj/e-cv.html

Curriculum vitae of Erzsébet Csuhaj-Varjú Personal Born: August 15, 1954, Debrecen, Hungary. Citizenship: Hungarian. Position Scientific advisor, head of a research group Address Computer and Automation Research Institute, Hungarian Academy of Sciences Kende u 13-17, H-1111 Budapest, Hungary Phone : (+36) (1) 279-6139, Fax: (+36) (1) 4667-503 E-mail : csuhaj@sztaki.hu URL: http://www.sztaki.hu/~csuhaj Languages High-level English. Fair knowledge of Russian and German. Hungarian (mother tongue). Education Doctor of the Hungarian Academy of Sciences (D.Sc.), 2003. Degree Candidate of Mathematical Sciences (Ph. D. equivalent), 1993, Hungarian Scientific Qualification Comittee, Budapest, Hungary. Degree Doctor Rerum Naturalis in Computer Science, 1980, Lajos Kossuth University of Sciences, Debrecen, Hungary (summa cum laude). Master's Degree in Mathematics, 1977, Lajos Kossuth University of Sciences, Debrecen, Hungary. Research Interests Formal Languages, Multi-Agent Systems, Natural Computing, Natural Language Processing. Professional experience Computer and Automation Research Institute, Hungarian Academy of Sciences

75. Helena Rasiowa Université Montpellier II Translate this page helena rasiowa (1917-1994). Cette image et la biographie complète en anglaisrésident sur le site de l’université de St Andrews Écosse http://ens.math.univ-montp2.fr/SPIP/article.php3?id_article=1708

76. Center For Logic, Epistemology And The History Of The Science - CLE Alfred Tarski (Berkeley); helena rasiowa (Warsaw); Gottfried Gabriel (Konstanz);Cecilia Rauszer (Warsaw); Richard L. Epstein (Berkeley); Rizsard Wojcicki http://www.cle.unicamp.br/english/page_ing.htm

THE CENTRE FOR LOGIC, EPISTEMOLOGY AND THE HISTORY OF SCIENCE Areas of Work Though mainly of interdisciplinary character, the research developed in the CENTER FOR LOGIC, EPISTEMOLOGY AND THE HISTORY OF SCIENCE (CLE) is organized into four individual areas: Epistemology and Philosophy of Science, History of Science, Interdisciplinary Studies, Logic. The area of EPISTEMOLOGY AND PHILOSOPHY OF SCIENCE concentrates its activities under what we could call an analytic perspective, if we understand by this term the application of rigorous methods (including formal ones) both to formulate and to solve philosophical problems. The main interests of the researchers in this area are: Philosophy of Formal Sciences logic, mahtematics and the foundations of computer science Philosophy of Human Sciences Philosophy of Mind Philosophy of Language Their main publication is MANUSCRITO. The area of HISTORY OF SCIENCE concentrates its activities presently in the History of Physics, albeit the natural difficulties due to the lack of tradition in this field in Brazil. The CLE maintains an Archive for Documentation in the History of Sciences which primarily collects and organizes material from Brazilian and Latin-American sources.

77. Nicolas.Peltier Essays dedicated to the memory of helena rasiowa (Part 5Logic in ComputerScience, Chap. 20). PhysicaVerlag, 1998. bib . 33, N. Peltier. http://www-leibniz.imag.fr/ATINF/Nicolas.Peltier/Nicolas.Peltier.html

N. Peltier. A Resolution Calculus for Shortening Proofs. Logic Journal of the Interest Group in Pure and Applied Logics , 2005. Accepted, to appear. bib R. Caferra and N. Peltier. Accepting/rejecting Proposition from Accepted/Rejected Propositions: a Unifying Overview. International Journal of Intelligent Systems , 2005. Accepted, to appear. bib N. Peltier. A proof procedure for functional first order logic programs with non-deterministic lazy functions and built-in predicates. Journal of Functional and Logic Programming , 2004(3), November 2004. bib N. Peltier. Some techniques for branch-saturation in free-variable tableaux. In J. Alferes and J. Leite, editors, JELIA'04 (Logics in Artificial Intelligence, Ninth European Conference) . Springer LNCS, September 2004. bib R. Caferra, A. Leitsch, and N. Peltier. Automated Model Building , volume 31 of Applied Logic Series . Kluwer Academic Publishers, 2004. bib N. Peltier. The First Order Theory of Primal Grammars is Decidable. Theoretical Computer Science bib N. Peltier. Representing and building models for decidable subclasses of equational clausal logic.

78. The ATINF Project: Publications By Author Essays dedicated to the memory of helena rasiowa (Part 5Logic in ComputerScience, Chap. 20). PhysicaVerlag, 1998. BibTeX entry http://www-leibniz.imag.fr/ATINF/Publi-auteur-ENG.html

The ATINF Project Logics and mechanization of inference Publications by author P. Balbiani and S. Demri. Prefixed tableaux systems for modal logics with enriched languages. In IJCAI-15, Nagoya , pages 190-195. Morgan Kaufmann, August 1997. BibTeX entry C. Bourely. Construction de modèles et problèmes équationnels. Rapport de DEA, ENSIMAG, Septembre 1989. BibTeX entry C. Bourely, R. Caferra, and N. Peltier. A Method for Building Models Automatically. Experiments with an extension of OTTER. In Proceedings of CADE-12 , pages 72-86. Springer LNAI 814, 1994. BibTeX entry C. Bourely, G. Défourneaux, and N. Peltier. Building Proofs or Counterexamples by Analogy in a Resolution Framework. In Proceedings of JELIA 96 , pages 34-49. Springer LNAI 1126, 1996. BibTeX entry Compressed PS C. Bourely and N. Peltier. DISC-ATINF: a System for Implementing Strategies and Calculi. In Proceeding of DISCO'96 . Springer, 1996. BibTeX entry T. Boy de la Tour. A locally optimal transformation into clause form using partial formula renaming. Rr 765-i-imag - 90 lifia, institut IMAG, BP 68, 38402 Saint Martin d'Hères cedex, Jan. 1989. BibTeX entry T. Boy de la Tour. Minimizing the number of clauses by renaming. In M. E. Stickel, editor

79. Robin Hirsch's Publications In Logic at work Essays dedicated to the memory of helena rasiowa, Studia Logicalibrary, pages 158-167, Kluwer academic publishers, Dordrecht, 1998. http://www.cs.ucl.ac.uk/staff/R.Hirsch/publications.html

Robin Hirsch 's Publications All on-line papers are in postscript format. Some of my publications: R. Hirsch. Mathematics - the pure science? In Science and Society Spring 1996 issue, Vol. 60, No. 1, pp58 -79. R. Hirsch Dialectics and Logic. In Cultural Logic Spring 2004. R. Hirsch and I. Hodkinson. Relation Algebras by Games Volume 147 in Studies in Logic and the Foundations of Mathematics series, published by Elsevier Science, North-Holland, 2002. Reviews of the book. R. Hirsch and I. Hodkinson. Games in algebraic logic. Presented at the Amsterdam Colloquium , December 1997, organised by the Institute for Logic, Language and Computation. R. Hirsch and I. Hodkinson. Axiomatising various classes of relation and cylindric algebras. In Proc. Workshop on Logic, Language, Information, and Computation , Recife, July 1995. Also appears in Wollic95 Special Issue of the Journal of the Interest Group in Pure and Applied Logics Vol. 5, No. 2, pp 209 - 229, 1997. R. Hirsch and I. Hodkinson. Step by step - building representations in algebraic logic. In the Journal of Symbolic Logic , volume 62, number 1, pages 225 - 279, March 1997. Includes game-theoretic characterisation of representations of relation algebras and a first-order characterisation of RRA.

80. List Of Publications In Logic at Work (Essays Dedicated to the Memory of helena rasiowa), Studiesin Fuzziness and Soft Computing series. Editor E. Orlowska PhysicaVerlag, http://www.renyi.hu/~sain/pub.html

Papers, abstracts, preprints and manuscripts in reversed chronological order Sain,I. and Simon,A.: The Complexity of Equational Theory of Relational Algebras with Standard Projection Elements. Preprint version. Sain,I.: On the search for a finitizable algebraization of first order logic. Logic Journal of the IGPL, July 2000, vol.8, no.4, 495-589. Electronically available: http://www.jigpal.oupjournals.org. Editorial. Logic Journal of the IGPL, July 2000, vol.8, no.4, 377-379. Electronically available: http://www.jigpal.oupjournals.org. Preprint version. Sain,I.: On Characterizations of Definability Properties in Abstract Algebraic Logic, In: Proceedings of the "Workshop on Abstract Algebraic Logic". Editors: J. M. Font, R. Jansana and D. Pigozzi. C.R.M. series 'Quaderns' (`Centre de Recerca Matematica' of the 'Institut d'Estudis Catalans') Jan. 1998, 15 pp. Sain,I. and Gyuris,V.: Finite Schematizable Algebraic Logic. Logic Journal of the IGPL, September 1997, vol.5, no.5, 699-751. Electronically available: http://www.jigpal.oupjournals.org. revised version Sain, I.: On finitizing first order logic. Bulletin of the Section of Logic. Univ. of Wroclaw, 1994, vol.23, no.2, 66-79.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 4     61-80 of 99    Back | 1  | 2  | 3  | 4  | 5  | Next 20