A Certain Class of Models of Peano Arithmetic. - Roman Kossak (J. Symb. Log., 1983)

A note on satisfaction classes. - Roman Kossak (Notre Dame J. Formal Log., 1985)

Recursively saturated ω1-like models of arithmetic. - Roman Kossak (Notre Dame J. Formal Log., 1985)

A Note on BΣn and an Intermediate Induction Schema. - Zofia Adamowicz; Roman Kossak (Math. Log. Q., 1988)

Models with the omega-Property. - Roman Kossak (J. Symb. Log., 1989)

A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. - Roman Kossak; Mark E. Nadel; James H. Schmerl (J. Symb. Log., 1989)

Automorphisms of Recursively Saturated Models of Arithmetic. - Richard Kaye; Roman Kossak; Henryk Kotlarski (Ann. Pure Appl. Log., 1991)

Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic. - Roman Kossak; James H. Schmerl (Notre Dame J. Formal Log., 1991)

Subsets of models of arithmetic. - Roman Kossak; Jeffrey B. Paris (Arch. Math. Log., 1992)

Game Approximations of Satisfaction Classes Models. - Roman Kossak; Henryk Kotlarski (Math. Log. Q., 1992)

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)

Four Problems Concerning Recursively Saturated Models of Arithmetic. - Roman Kossak (Notre Dame J. Formal Log., 1995)

Arithmetically Saturated Models of Arithmetic. - Roman Kossak; James H. Schmerl (Notre Dame J. Formal Log., 1995)

On two questions concerning the automorphism groups of countable recursively saturated models of PA. - Roman Kossak; Nicholas Bamber (Arch. Math. Log., 1996)

Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets. - Roman Kossak (Log. J. IGPL, 1997)

A note on a theorem of Kanovei. - Roman Kossak (Arch. Math. Log., 2004)

Undefinability of truth and nonstandard models. - Roman Kossak (Ann. Pure Appl. Log., 2004)

Automorphism group actions on trees. - Aleksander Ivanov; Roman Kossak (Math. Log. Q., 2004)

On Some Uses of Nonstandard Models. - Roman Kossak (Fundam. Informaticae, 2007)

The complexity of classification problems for models of arithmetic. - Samuel Coskey; Roman Kossak (Bull. Symb. Log., 2010)

On Cofinal Submodels and Elementary Interstices. - Roman Kossak; James H. Schmerl (Notre Dame J. Formal Log., 2012)

From the editors. - Åsa Hirvonen; Juha Kontinen; Roman Kossak; Andrés Villaveces (Logic Without Borders, 2015)

Neutrally expandable models of arithmetic. - Athar Abdul-Quader; Roman Kossak (Math. Log. Q., 2019)

Disjunctions with Stopping conditions. - Roman Kossak; Bartosz Wcislo (Bull. Symb. Log., 2021)