Henryk Kotlarski

According to our database, Henryk Kotlarski authored at least 27 papers between 1973 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2009

On a question of Andreas Weiermann.

Henryk Kotlarski, Konrad Zdanowski

Math. Log. Q., 2009

2007

More on lower bounds for partitioning alpha-large sets.

Henryk Kotlarski, Bozena Piekart, Andreas Weiermann

Ann. Pure Appl. Log., 2007

2005

Some variations of the Hardy hierarchy.

Henryk Kotlarski, Bozena Piekart

Math. Log. Q., 2005

2004

The incompleteness theorems after 70 years.

Henryk Kotlarski

Ann. Pure Appl. Log., 2004

2000

Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely.

Henryk Kotlarski, Bozena Piekart

Math. Log. Q., 2000

On Models Constructed by Means of the Arithmetized Completeness Theorem.

Richard Kaye, Henryk Kotlarski

Math. Log. Q., 2000

1998

Other Proofs of Old Results.

Henryk Kotlarski

Math. Log. Q., 1998

1997

On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic.

Nicholas Bamber, Henryk Kotlarski

Math. Log. Q., 1997

1996

An Addition to Rosser's Theorem.

Henryk Kotlarski

J. Symb. Log., 1996

1995

Automorphisms of Countable Recursively Saturated Models of PA: a Survey.

Henryk Kotlarski

Notre Dame J. Formal Log., 1995

Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts.

Henryk Kotlarski, Bozena Piekart

Math. Log. Q., 1995

1994

Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups.

Henryk Kotlarski, Richard Kaye

Notre Dame J. Formal Log., 1994

Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely.

Bozena Piekart, Henryk Kotlarski

Math. Log. Q., 1994

On the Incompleteness Theorems.

Henryk Kotlarski

J. Symb. Log., 1994

1993

On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA.

Roman Kossak, Henryk Kotlarski, James H. Schmerl

Ann. Pure Appl. Logic, 1993

1992

Game Approximations of Satisfaction Classes Models.

Roman Kossak, Henryk Kotlarski

Math. Log. Q., 1992

1991

Full Satisfaction Classes: A Survey.

Henryk Kotlarski

Notre Dame J. Formal Log., 1991

Automorphisms of Recursively Saturated Models of Arithmetic.

Richard Kaye, Roman Kossak, Henryk Kotlarski

Ann. Pure Appl. Log., 1991

1990

More on induction in the language with a satisfaction class.

Henryk Kotlarski, Zygmunt Ratajczyk

Math. Log. Q., 1990

Inductive Full Satisfaction Classes.

Henryk Kotlarski, Zygmunt Ratajczyk

Ann. Pure Appl. Log., 1990

1989

On the End Extension Problem For Δ₀-PA(<i>S</i>).

Henryk Kotlarski

Math. Log. Q., 1989

1986

Bounded Induction and Satisfaction Classes.

Henryk Kotlarski

Math. Log. Q., 1986

The Recursively Saturated Part of Models of Peano Arithmetic.

Henryk Kotlarski

Math. Log. Q., 1986

1984

Some Remarks on Initial Segments in Models of Peano Arithmetic.

Henryk Kotlarski

J. Symb. Log., 1984

1983

On Cofinal Extensions of Models of Arithmetic.

Henryk Kotlarski

J. Symb. Log., 1983

1980

On Skolem Ultrapowers and Their Non-Standard Variant.

Henryk Kotlarski

Math. Log. Q., 1980

1973

Some Simple Results on Automorphisms of Models.

Henryk Kotlarski

Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys., 1973