Curriculum Vitae

Institute of Mathematics
University of Bialystok
ul. Akademicka 2
15-267 Bialystok, Poland

Education:

• Master degree: Warsaw University, Bialystok Campus (1990)
• Doctorate: Polish Academy of Sciences, Institute of Mathematics (1997)

• Institute of Mathematics, Warsaw University, Bialystok Branch
  assistant professor 1990-1997
• Institute of Mathematics, Polish Academy of Sciences
  assistant professor 1991-1992
• Institute of Mathematics, University of Bialystok
  associate professor 1998-

1. main field - algebraic and categorial aspects of logic
2. other fields - continuous lattices, computation theory
3. current research interest - computer aided formalization of mathematics

1. Association of Mizar Users (Stowarzyszenie Uzytkownikow Mizara), member of the Board
2. American Mathematical Society
3. Association for Computing Machinery, Polish Chapter
4. Polish Society of Logic and Philosophy of Sciences (Polskie Towarzystwo Logiczne i Filozofii Nauk)

• The Sleszynski Prize of the Association of Mizar Users (1991)
• The Lesniewski Prize of the Association of Mizar Users (1993)
• The Lesniewski Prize of the Association of Mizar Users (1996)
• The Prize of the Rector of University of Bialystok (1997)

• In 1996-1997 I led the topic group in ONR Grant N00014-95-1-1336.
• In 1997-1998 I was co-principal investigator in ONR Grant N00014-97-1-0777.
• In 1998 I got CSMSFB Grant, Berlin ICM'98.

List of selected publications:

1. A model of ZF set theory language. Formalized Mathematics, 1(1):131-145, 1990.
2. The contraction lemma. Formalized Mathematics, 1(1):201-203, 1990.
3. The reflection theorem. Formalized Mathematics, 1(5):973-977, 1990.
4. Consequences of the reflection theorem. Formalized Mathematics, 1(5):989-993, 1990.
5. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.
6. Tarski's classes and ranks. Formalized Mathematics, 1(3):563-567, 1990.
7. Universal classes. Formalized Mathematics, 1(3):595-600, 1990. (coauthor Bogdan Nowak)
8. Zermelo theorem and axiom of choice. Formalized Mathematics, 1(2):265-267, 1990.
9. Kuratowski - Zorn lemma. Formalized Mathematics, 1(2):387-393, 1990. (coauthor Wojciech A. Trybulec)
10. Countable sets and Hessenberg's theorem. Formalized Mathematics, 2(1):65-69, 1991.
11. König's lemma. Formalized Mathematics, 2(3):397-402, 1991.
12. The mutilated chessboard problem. In R. Matuszewski, editor, The QED Workshop II, Technical Report No. L/1/95, pages 37-38, Warsaw University, Bialystok Branch, 1995.
13. Minimal signature for partial algebra. Formalized Mathematics, 5(3):405-414, 1996.
14. Translations, endomorphisms, and stable equational theories. Formalized Mathematics, 5(4):553-564, 1996.
15. Institution of many sorted algebras. Part I: Signature reduct of an algebra. Formalized Mathematics, 6(2):279-287, 1997.
16. Complete lattices. Formalized Mathematics, 2(5):719-725, 1991.
17. Bounds in posets and relational substructures. Formalized Mathematics, 6(1):81-91, 1997.
18. Closure operators and subalgebras. Formalized Mathematics, 6(2):295-301, 1997.
19. Directed sets, nets, ideals, filters, and maps. Formalized Mathematics, 6(1):93-107, 1997.
20. Duality in relational structures. Formalized Mathematics, 6(2):227-232, 1997.
21. Prime ideals and filters. Formalized Mathematics, 6(2):241-247, 1997.
22. The ``way-below'' relation. Formalized Mathematics, 6(1):169-176, 1997.
23. Bases and refinements of topologies. Journal of Formalized Mathematics, 10, 1998.
24. The Lawson topology. Journal of Formalized Mathematics, 10, 1998.
25. Lawson topology and continuous lattices. Journal of Formalized Mathematics, 10, 1998.
26. Semi automated translation for mathematics. In J. Darski and Z. Vetulani, editors, Sprache-Kommunikation-Informatik, pages 131-136, Akten des 26. Linguistischen Kolloquiums, Niemeyer, Poznan, 1991. (coauthor Patricia Carlson)
27. Combining of circuits. Formalized Mathematics, 5(2):283-295, 1996. (coauthor Yatsuka Nakamura)
28. Full adder circuit. Part I. Formalized Mathematics, 5(3):367-380, 1996. (coauthor Yatsuka Nakamura)
29. Development of terminology for SCM. Formalized Mathematics, 4(1):61-67, 1993. (coauthor Piotr Rudnicki)
30. Two programs for SCM. Part II - programs. Formalized Mathematics, 4(1):73-75, 1993. (coauthor Piotr Rudnicki)
31. A compiler of arithmetic expressions for SCM. Formalized Mathematics, 5(1):15-20, 1996. (coauthor Piotr Rudnicki)