Zofia Adamowicz, professor

My field of research is Foundations of Arithmetic. I am interested in independence questions concerning fragments of Peano Arithmetic, mainly concerning Bounded Arithmetic and the Bounded Matiayasevič Conjecture.

Selected Publications:

• with Paweł Zbierski Logic of mathematics. A modern course of classical logic. Pure and Applied Mathematics. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1997. x+260 pp. ISBN: 0-471-06026-7
• End-extending models of IΔ₀+exp+ BΣ₁. Fund. Math. 136, no. 3, 133--145, 1990.
• On maximal theories. J. Symbolic Logic 56, no. 3, 885--890, 1991.
• A sharp version of the bounded Matijasevich conjecture and the end-extension problem. J. Symbolic Logic 57(2), 597--616, 1992.
• A contribution to the end-extension problem and the Π₁ conservativeness problem, Ann. Pure Appl. Logic 61, pp. 3-48, 1993.
• The power of exponentiation in arithmetic. First European Congress of Mathematics, Vol. I (Paris, 1992), Progr. Math., 119, Birkhäuser, Basel, 1994.
• Existentially Closed Structures and Gödel's Second Incompleteness Theorem (with T. Bigorajska), J. Symb. Log, 66(1), pp. 349-356, 2001.
• On Herbrand consistency in weak arithmetic (with P. Zbierski), Arch. Math. Logic, 40(6), pp. 399-413, 2001
• Herbrand Consistency and Bounded Arithmetic, Fundamenta Mathematica, 171, pp. 279-292, 2002,  dvi file
• On complexity reduction of Σ₁ formulas (with P. Zbierski), Arch. Math. Logic 42(1), pp. 45-58, 2003.
• Well-behaved principles alternative to bounded induction (with L. A. Kołodziejczyk), Theor. Comput. Sci. 322(1), pp. 5-16, 2004, pdf file.
• Partial collapses of the Sigma₁ complexity hierarchy in models for fragments of bounded arithmetic (with L. A. Kołodziejczyk and P. Zbierski), Ann. Pure Appl. Logic, 145(1), pp. 91-95, 2007, pdf file.
• Lower bounds for the unprovability of Herbrand consistency in weak arithmetics (with K. Zdanowski), submitted, pdf file.
• Parameter free polynomial induction versus linear induction Zofia Adamowicz, pdf file.