Henryk Kotlarski

27 papers Journal 27
YearRankTypeTitle / Venue / Authors
2009 J jnl
On a question of Andreas Weiermann.
Math. Log. Q.
Henryk Kotlarski, Konrad Zdanowski
2007 J jnl
More on lower bounds for partitioning alpha-large sets.
Ann. Pure Appl. Log.
Henryk Kotlarski, Bozena Piekart, Andreas Weiermann
2005 J jnl
Some variations of the Hardy hierarchy.
Math. Log. Q.
Henryk Kotlarski, Bozena Piekart
2004 J jnl
The incompleteness theorems after 70 years.
Ann. Pure Appl. Log.
Henryk Kotlarski
2000 J jnl
Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely.
Math. Log. Q.
Henryk Kotlarski, Bozena Piekart
2000 J jnl
On Models Constructed by Means of the Arithmetized Completeness Theorem.
Math. Log. Q.
Richard Kaye, Henryk Kotlarski
1998 J jnl
Other Proofs of Old Results.
Math. Log. Q.
Henryk Kotlarski
1997 J jnl
On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic.
Math. Log. Q.
Nicholas Bamber, Henryk Kotlarski
1996 J jnl
An Addition to Rosser's Theorem.
J. Symb. Log.
Henryk Kotlarski
1995 J jnl
Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts.
Math. Log. Q.
Henryk Kotlarski, Bozena Piekart
1995 J jnl
Automorphisms of Countable Recursively Saturated Models of PA: a Survey.
Notre Dame J. Formal Log.
Henryk Kotlarski
1994 J jnl
Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups.
Notre Dame J. Formal Log.
Henryk Kotlarski, Richard Kaye
1994 J jnl
Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely.
Math. Log. Q.
Bozena Piekart, Henryk Kotlarski
1994 J jnl
On the Incompleteness Theorems.
J. Symb. Log.
Henryk Kotlarski
1993 J jnl
On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA.
Ann. Pure Appl. Logic
Roman Kossak, Henryk Kotlarski, James H. Schmerl
1992 J jnl
Game Approximations of Satisfaction Classes Models.
Math. Log. Q.
Roman Kossak, Henryk Kotlarski
1991 J jnl
Automorphisms of Recursively Saturated Models of Arithmetic.
Ann. Pure Appl. Log.
Richard Kaye, Roman Kossak, Henryk Kotlarski
1991 J jnl
Full Satisfaction Classes: A Survey.
Notre Dame J. Formal Log.
Henryk Kotlarski
1990 J jnl
Inductive Full Satisfaction Classes.
Ann. Pure Appl. Log.
Henryk Kotlarski, Zygmunt Ratajczyk
1990 J jnl
More on induction in the language with a satisfaction class.
Math. Log. Q.
Henryk Kotlarski, Zygmunt Ratajczyk
1989 J jnl
On the End Extension Problem For Δ
Math. Log. Q.
Henryk Kotlarski
1986 J jnl
Bounded Induction and Satisfaction Classes.
Math. Log. Q.
Henryk Kotlarski
1986 J jnl
The Recursively Saturated Part of Models of Peano Arithmetic.
Math. Log. Q.
Henryk Kotlarski
1984 J jnl
Some Remarks on Initial Segments in Models of Peano Arithmetic.
J. Symb. Log.
Henryk Kotlarski
1983 J jnl
On Cofinal Extensions of Models of Arithmetic.
J. Symb. Log.
Henryk Kotlarski
1980 J jnl
On Skolem Ultrapowers and Their Non-Standard Variant.
Math. Log. Q.
Henryk Kotlarski
1973 J jnl
Some Simple Results on Automorphisms of Models.
Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys.
Henryk Kotlarski