Kliknij by powiększyć zdjęcie
Strona domowa
Badania naukowe
Dydaktyka
Inne materiały
Wybory Rektora 2002
Wersja do druku Wersja drukowalna
English version English version
Leszek Pacholski

Lista publikacji

Publikacje oryginalne od 1988 roku

  1. Leszek Pacholski, Counting and the polynomial time hierarchy, Proceedings of the 6th Easter Conference, Berlin 1988, str. 141-150
  2. Leszek Pacholski, Wiesław Szwast, The 0-1 law fails for the class of existential second-order Gödel Sentences with equality, Proceedings of the 30st Annual IEEE Symposium on Foundations of Computer Science (FOCS'89), IEEE Computer Society Press, 1989, str. 160-163
  3. Antoni Kościelski, Leszek Pacholski, Complexity of unification in free groups and free semigroups, Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90), IEEE Computer Society Press, 1990, str. 824-829 (Postscript)
  4. Leszek Pacholski, Wiesław Szwast, On the 0-1 law for the class of existential second order minimal Gödel sentences with equality, Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science(LICS'91), IEEE Computer Society Press, 1991, str. 280-285
  5. Leszek Pacholski, Wiesław Szwast, Asymptotic probabilities of existential second order Gödel sentences, Journal of Symbolic Logic, 56 (2), June 1991, str. 427-438
  6. Jerzy Marcinkowski, Leszek Pacholski, Undecidability of the Horn clause implication problem, Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'92), IEEE Computer Society Press, 1992, str. 354-362
  7. Witold Charatonik, Leszek Pacholski, Word Equations with Two Variables, Proceedings of the Second International Workshop on Word Equations and Related Topics (IWWERT'91), H. Abdulrab, J.-P. Pecuchet (eds.), Lecture Notes in Computer Science 667,  Springer-Verlag, Berlin, 1993, str. 43-56 (Postscript)
  8. Leszek Pacholski, Decidability of finiteness properties, Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems (CTRS'92), M. Rusinowitch, J.-L. Remy (eds.), Lecture Notes in Computer Science 656,  Springer-Verlag, Berlin, 1993, str. ??-??
  9. Leszek Pacholski, Undecidability of implication problems in logic programming, database theory and classical logic, Proceedings of the Third Kurt Gödel Colloquium (KGC'93): Computational Logic and Proof Theory, G. Gottlob, A. Leitsch, D. Mundici (eds.), Lecture Notes in Computer Science 713,  Springer-Verlag, Berlin, 1993, str. 63-68
  10. Leszek Pacholski, Wiesław Szwast, A counterexample to the 0-1 law for existential second order minimal Gödel sentences, Information and Computation, 107 (1), November 1993, str. 91-103
  11. Witold Charatonik, Leszek Pacholski, Negative set constraints with equality, Proceedings of the 9th IEEE Symposium on Logic in Computer Science (LICS'94), IEEE Computer Society Press, 1994, str. 128-136
  12. Witold Charatonik, Leszek Pacholski, Set constraints with projections are in NEXPTIME, Proceedings of the the 35th Annual Symposium on Foundations of Computer Science (FOCS'94), Shafi Goldwasser (ed.), IEEE Computer Society Press, 1994, str. 642-653
  13. Antoni Kościelski, Leszek Pacholski, Complexity of Makanin's algorithm, Journal of the Association for Computing Machinery, 43 (4), July 1996, str. 670-684
  14. Leszek Pacholski, Andreas Podelski, Set Constraints: a Pearl in Research on Constraints, Proceedings of the Third Conference on Principles and Practice of Constraint Programming (CP'97), Gert Smolka, Lecture Notes in Computer Science 1330,  Springer-Verlag, Berlin, 1997, str. 549-561
  15. Leszek Pacholski, Wiesław Szwast, Lidia Tendera, Complexity of Two-variables logic with counting, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), IEEE Computer Society Press, 1997, str. 318-327
  16. Antoni Kościelski, Leszek Pacholski, Makanin's algorithm is not primitive recursive, Theoretical Computer Science, 191 (1-2), January 1998, str. 145-156
  17. Paweł Mielniczuk, Leszek Pacholski, Tarskian Set Constraints are in NEXPTIME, Proceedings of the 23rd Symposium na Mathematical Foundations of Computer Science (MFCS'98), L. Brim, J. Gruska, J. Zlatuska (eds.), Lecture Notes in Computer Science 1450,  Springer-Verlag, Berlin, 1998, str. 589-596
  18. Piotr Krysta, Leszek Pacholski, The STO problem is NP-complete, Journal of Symbolic Computation, 27 (2), February 1999, str. 207-219
  19. Leszek Pacholski, Wiesław Szwast, Lidia Tendera, Complexity of Two-variables logic with counting, SIAM Journal on Computing, 29 (4), 2000, str. 1083-1117
  20. Jerzy Marcinkowski, Leszek Pacholski, Thue trees, Annals of Pure and Applied Logic, 119 (1-3), February 2003, str. 19-60
  21. Witold Charatonik, Leszek Pacholski, Set constraints, 35 stron, złożone do druku

Publikacje oryginalne do 1987 roku

  1. Leszek Pacholski, Bogdan Węglorz, Topologically compact structures and positive formulas, Colloquium Mathematicum, 18, 1968, str. 37-42
  2. Leszek Pacholski, Elementary substructures of direct products, Bull. Acad. Polon. Sci., 18, 1969, str. 55-59, streszczenie w Journal of Symbolic Logic, 34, 1970, str. 534
  3. Leszek Pacholski, On products of first order theories, Bull. Acad. Polon. Sci., 18, 1969, str. 793-796
  4. Leszek Pacholski, On countably compact reduced products I, Fundamenta Mathematicae, 67, 1970, str. 155-161, streszczenie w Journal of Symbolic Logic, 35, 1971, str. 608
  5. Leszek Pacholski, On countably compact reduced products II, Bull. Acad. Polon. Sci., 19, 1970, str. 1-3
  6. Leszek Pacholski, On countably compact reduced products III, Colloquium Mathematicum, 23, 1971, str. 5-15
  7. Leszek Pacholski, J. Waszkiewicz, On compact classes of models, Fundamenta Mathematicae, 76, 1972, str. 139-147
  8. Leszek Pacholski, On countably universal Boolean algebras and compact classes of models, Fundamenta Mathematicae, 76, 1973, str. 34-60
  9. Leszek Pacholski, On limit reduced powers, saturatedness and universality, Lecture Notes in Mathematics Set Theory and Hierarchy, Springer-Verlag, Berlin, 537, str. 1976
  10. Leszek Pacholski, Homogenity, universality and saturatedness of limit reducedproducts III, Fundamenta Mathematicae, 75, 1977, str. 85-94
  11. Leszek Pacholski, Saturated limit reduced products, Set Theory and Hierarchy Theory I, J. Waszkiewicz (ed.), Wrocław, 1977, str. 79-90
  12. Leszek Pacholski, Homogeneous limit reduced powers, Archiv Für Mathematische Logik und Grundlagenforschung, 21, 1981, str. 131-136
  13. Leszek Pacholski, Saturated reduced products, Journal of Symbolic Logic, 45, 1981, str. 400
  14. Leszek Pacholski, Jerzy Tomasik, Reduced products which are not saturated, Algebra Universalis, 14, 1982, str. 210-227

Prace redakcyjne

  1. Logic Colloquium '77, tom sprawozdań z konferencji Logic Colloquium, Wrocław, sierpień 1997, A. Macintyre, Leszek Pacholski, J. Paris, red., North-Holland Publishing Company, Amsterdam, 1978
  2. Model Theory of Algebra and Arithmetic, tom sprawozdań z konferencji, Karpacz, 1-7 września 1979, Leszek Pacholski, Jędrzej Wierzejewski, Alec J. Wilkie, red., Lecture Notes in Mathematics 834, Springer-Verlag, Berlin, 1980
  3. Andrzej Mostowski, Selected Works, Kazimierz Kuratowski, Leszek Pacholski, red., PWN i North-Holland Publishing Company, Warszawa-Amsterdam, 1979
  4. Computer Science Logic '94, tom sprawozdań z konferencji, Jerzy Tiuryn, Leszek Pacholski, red., Lecture Notes in Computer Science 933,  Springer-Verlag, Berlin, 1995
  5. Mathematical Foundations of Computer Science '99, tom sprawozdań z konferencji, Mirosław Kutyłowski, Leszek Pacholski, Tomasz Wierzbicki, red., Lecture Notes in Computer Science 1672,  Springer-Verlag, Berlin, 1999
  6. SOFSEM 2001: Theory and Practice of Informatics, tom sprawozdań z konferencji The 28th Conference on Current Trends in Theory and Practice of Informatics, Peter Ruzicka, Leszek Pacholski, red., Lecture Notes in Computer Science 2234,  Springer-Verlag, Berlin, 2001

Inne publikacje

  1. Leszek Pacholski, Twierdzenie Gödla, Delta, 2, 1975, str. 5-7
  2. Leszek Pacholski, O pracy naukowej Andrzeja Mostowskiego, Matematyka, 2, XXIX (142), 1976, str. 70-72
  3. Leszek Pacholski, Program Hilberta, Delta, 5 (53), 1978, str. 1-5
  4. Leszek Pacholski, The works of Andrzej Mostowski in model theory, w: Andrzej Mostowski, Selected works, Kazimierz Kuratowski, Leszek Pacholski, red., PWN i North-Holland Publishing Company, Warszawa-Amsterdam, 1979, str. 28-35
  5. Antoni Kościelski, Leszek Pacholski, Logic Colloquium '77, Wiadomości Matematyczne, 22, 1979, str. 79-83
  6. Leszek Pacholski, Recencja książki: K. Kuratowski, A. Mostowski, Teoria Mnogości, Wiadomości Matematyczne, 23, 1981, str. 260-262
  7. Leszek Pacholski, Recencja książki: Y. N. Moschovakis, Descriptive Set Theory, Studia Logica, 41, 1982, str. 429-430
  8. Leszek Pacholski, Podstawy matematyki, hasło w:Encyklopedia Powszewchna PWN, Warszawa, 1986
  9. Czesław Ryll-Nardzewski, Leszek Pacholski, On research work of Kazimierz Kuratowski in abstract and descriptive set theory and in the theory of selectors, w: Kazimierz Kuratowski, Selected Papers, Karol Borsuk, red., Warszawa, 1988, str. XXVI-XXXII
  10. Leszek Pacholski, Indécidabilitée du problème de semi-unification, Seminaire Logique et Algorithmique, vol. VII (1989-90), P. Dehornoy, red., str. 147-160
  11. Czesław Ryll-Nardzewski, Leszek Pacholski, O pracy naukowej Kazimierza Kuratowskiego nad abstrakcyjną i opisową teorią mnogości, Nauka Polska, 5-6, 1992, str. 261-265
  12. Leszek Pacholski, In memoriam: Jerzy Łoś, The Bulletin of Symbolic Logic, 6 (1), March 2000, str. 97-100 (Postscript)
  13. Leszek Pacholski, Zacznijmy lepiej uczyć studentów, Tygodnik Powszechny, 43 (2885), Kraków, 24 października 2004
  14. Leszek Pacholski, Pierwszy problem milenijny: czy NP=P?, Wiadomości matematyczne, złożone do druku
Copyright © Leszek Pacholski, 2002–2005.