Roman Kossak

According to our database1, Roman Kossak authored at least 24 papers between 1983 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Disjunctions with Stopping conditions.
Bull. Symb. Log., 2021

2019
Neutrally expandable models of arithmetic.
Math. Log. Q., 2019

2015
From the editors.
Proceedings of the Logic Without Borders, 2015

2012
On Cofinal Submodels and Elementary Interstices.
Notre Dame J. Formal Log., 2012

2010
The complexity of classification problems for models of arithmetic.
Bull. Symb. Log., 2010

2007
On Some Uses of Nonstandard Models.
Fundam. Informaticae, 2007

2004
Automorphism group actions on trees.
Math. Log. Q., 2004

Undefinability of truth and nonstandard models.
Ann. Pure Appl. Log., 2004

A note on a theorem of Kanovei.
Arch. Math. Log., 2004

1997
Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets.
Log. J. IGPL, 1997

1996
On two questions concerning the automorphism groups of countable recursively saturated models of PA.
Arch. Math. Log., 1996

1995
Arithmetically Saturated Models of Arithmetic.
Notre Dame J. Formal Log., 1995

Four Problems Concerning Recursively Saturated Models of Arithmetic.
Notre Dame J. Formal Log., 1995

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

Subsets of models of arithmetic.
Arch. Math. Log., 1992

1991
Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic.
Notre Dame J. Formal Log., 1991

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

1989
A Note on the Multiplicative Semigroup of Models of Peano Arithmetic.
J. Symb. Log., 1989

Models with the omega-Property.
J. Symb. Log., 1989

1988
A Note on BΣ<sub><i>n</i></sub> and an Intermediate Induction Schema.
Math. Log. Q., 1988

1985
Recursively saturated ω<sub>1</sub>-like models of arithmetic.
Notre Dame J. Formal Log., 1985

A note on satisfaction classes.
Notre Dame J. Formal Log., 1985

1983
A Certain Class of Models of Peano Arithmetic.
J. Symb. Log., 1983


  Loading...