Henryk Kotlarski

From MaRDI portal
Person:598274

Available identifiers

zbMath Open kotlarski.henrykMaRDI QIDQ598274

List of research outcomes





PublicationDate of PublicationType
A model-theoretic approach to proof theory. Edited by Zofia Adamowicz, Teresa Bigorajska and Konrad Zdanowski2019-09-04Paper
https://portal.mardi4nfdi.de/entity/Q30724942011-02-03Paper
On a question of Andreas Weiermann2009-04-09Paper
https://portal.mardi4nfdi.de/entity/Q35091692008-07-01Paper
More on extending automorphisms of models of Peano Arithmetic2008-06-23Paper
More on lower bounds for partitioning \(\alpha\)-large sets2007-07-16Paper
Partitioning 𝛼–large sets: Some lower bounds2007-02-01Paper
Some variations of the Hardy hierarchy2005-08-01Paper
The incompleteness theorems after 70 years2004-08-06Paper
Some combinatorics involving Ξ-large sets2003-01-28Paper
On Models Constructed by Means of the Arithmetized Completeness Theorem2001-06-18Paper
https://portal.mardi4nfdi.de/entity/Q49394062000-07-27Paper
https://portal.mardi4nfdi.de/entity/Q47002392000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42225941999-08-31Paper
Other Proofs of Old Results1999-01-06Paper
On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic1998-03-17Paper
https://portal.mardi4nfdi.de/entity/Q48823881996-08-04Paper
An addition to Rosser's theorem1996-06-02Paper
Automorphisms of countable recursively saturated models of PA: A survey1996-05-22Paper
Automorphisms of models of true arithmetic: Recognizing some basic open subgroups1995-11-09Paper
Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts1995-07-20Paper
On the incompleteness theorems1995-02-13Paper
GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS1994-12-01Paper
Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely1994-10-05Paper
On maximal subgroups of the automorphism group of a countable recursively saturated model of PA1994-09-26Paper
Full satisfaction classes: A survey1992-06-28Paper
Automorphisms of recursively saturated models of arithmetic1992-06-28Paper
More on induction in the language with a satisfaction class1990-01-01Paper
Inductive full satisfaction classes1990-01-01Paper
On the End Extension Problem For Δ0-PA(S)1989-01-01Paper
Results on automorphisms of recursively saturated models of PA1988-01-01Paper
Bounded Induction and Satisfaction Classes1986-01-01Paper
The Recursively Saturated Part of Models of Peano Arithmetic1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37123401985-01-01Paper
On elementary cuts in recursively saturated models of Peano Arithmetic1984-01-01Paper
Some remarks on initial segments in models of Peano arithmetic1984-01-01Paper
On elementary cuts in models of arithmetic1983-01-01Paper
On cofinal extensions of models of arithmetic1983-01-01Paper
Construction of Satisfaction Classes for Nonstandard Models1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39242041981-01-01Paper
On Skolem Ultrapowers and Their Non‐Standard Variant1980-01-01Paper
Some remarks on well-ordered models1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41920481978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47758661974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32152151973-01-01Paper

Research outcomes over time

This page was built for person: Henryk Kotlarski