Follow
Leszek Pacholski
Leszek Pacholski
professor of computer science, Wroclaw University
Verified email at cs.uni.wroc.pl
Title
Cited by
Cited by
Year
The type theoretic interpretation of constructive set theory
P Aczel
Studies in Logic and the Foundations of Mathematics 96, 55-66, 1978
4351978
Complexity of two-variable logic with counting
L Pacholski, W Szwast, L Tendera
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997
1111997
Complexity of Makanin's algorithm
A Kościelski, L Pacholski
Journal of the ACM (JACM) 43 (4), 670-684, 1996
1011996
Complexity results for first-order two-variable logic with counting
L Pacholski, WL Szwast, L Tendera
SIAM Journal on Computing 29 (4), 1083-1117, 2000
892000
Set constraints with projections are in NEXPTIME
W Charatonik, L Pacholski
Proceedings 35th Annual Symposium on Foundations of Computer Science, 642-653, 1994
841994
Negative set constraints with equality
W Charatonik, L Pacholski
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 128-136, 1994
751994
Set constraints: A pearl in research on constraints
L Pacholski, A Podelski
International Conference on Principles and Practice of Constraint …, 1997
651997
Undecidability of the horn-clause implication problem
J Marcinkowski, L Pacholski
FOCS, 354-362, 1992
631992
Word equations with two variables
W Charatonik, L Pacholski
International Workshop on Word Equations and Related Topics, 43-56, 1991
281991
Makanin's algorithm is not primitive recursive
A Kościelski, L Pacholski
Theoretical Computer Science 191 (1-2), 145-156, 1998
271998
Complexity of unification in free groups and free semi-groups
A Koscielski, L Pacholski
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
231990
The 0-1 law fails for the class of existential second order Godel sentences with equality
L Pacholski, W Szwast
30th Annual Symposium on Foundations of Computer Science, 160-163, 1989
221989
On countably compact reduced products, III
L Pacholski
Colloquium Mathematicum 1 (23), 5-15, 1971
151971
On countably universal Boolean algebras compact classes of models
L Pacholski
Fundamenta Mathematicae 1 (78), 43-60, 1973
141973
A counterexample to the 0-1 law for the class of existential second-order minimal Gödel sentences with equality
L Pacholski, W Szwast
Information and Computation 107 (1), 91-103, 1993
121993
Logic Colloquium'77 Proceedings of the Colloquium Held in Wroclw, August 1977
A Macintyre, L Pacholski, JB Paris
101978
Topologically compact structures and positive formulas
L Pacholski, B Węglorz
Colloquium Mathematicae 19 (1), 37-42, 1968
101968
Model Theory of Algebra and Arithmetic
L Pacholski, J Wierzejewski, AJ Wilkie
Springer, 1980
91980
Asymptotic probabilities of existential second-order Gödel sentences
L Pacholski, WŁ Szwast
The Journal of symbolic logic 56 (2), 427-438, 1991
81991
Tarskian set constraints are in NEXPTIME
P Mielniczuk, L Pacholski
Mathematical Foundations of Computer Science 1998: 23rd International …, 1998
71998
The system can't perform the operation now. Try again later.
Articles 1–20