Henryk Kotlarski

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2009
On a question of Andreas Weiermann.
Math. Log. Q., 2009

2007
More on lower bounds for partitioning alpha-large sets.
Ann. Pure Appl. Logic, 2007

2005
Some variations of the Hardy hierarchy.
Math. Log. Q., 2005

2004
The incompleteness theorems after 70 years.
Ann. Pure Appl. Logic, 2004

2000
Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely.
Math. Log. Q., 2000

On Models Constructed by Means of the Arithmetized Completeness Theorem.
Math. Log. Q., 2000

1998
Other Proofs of Old Results.
Math. Log. Q., 1998

1997
On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic.
Math. Log. Q., 1997

1996
An Addition to Rosser's Theorem.
J. Symb. Log., 1996

1995
Automorphisms of Countable Recursively Saturated Models of PA: a Survey.
Notre Dame Journal of Formal Logic, 1995

Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts.
Math. Log. Q., 1995

1994
Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups.
Notre Dame Journal of Formal Logic, 1994

Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely.
Math. Log. Q., 1994

On the Incompleteness Theorems.
J. Symb. Log., 1994

1993
On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA.
Ann. Pure Appl. Logic, 1993

1992
Game Approximations of Satisfaction Classes Models.
Math. Log. Q., 1992

1991
Full Satisfaction Classes: A Survey.
Notre Dame Journal of Formal Logic, 1991

Automorphisms of Recursively Saturated Models of Arithmetic.
Ann. Pure Appl. Logic, 1991

1990
More on induction in the language with a satisfaction class.
Math. Log. Q., 1990

Inductive Full Satisfaction Classes.
Ann. Pure Appl. Logic, 1990

1989
On the End Extension Problem For Δ0-PA(S).
Math. Log. Q., 1989

1986
Bounded Induction and Satisfaction Classes.
Math. Log. Q., 1986

The Recursively Saturated Part of Models of Peano Arithmetic.
Math. Log. Q., 1986

1984
Some Remarks on Initial Segments in Models of Peano Arithmetic.
J. Symb. Log., 1984

1983
On Cofinal Extensions of Models of Arithmetic.
J. Symb. Log., 1983

1980
On Skolem Ultrapowers and Their Non-Standard Variant.
Math. Log. Q., 1980

1973
Some Simple Results on Automorphisms of Models.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., 1973


  Loading...