• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

Roman Kossak

CUNY Graduate Center
  •  Home
  •  Publications
    82
    • Most Recent
    • Most Downloaded
    • Topics
  •  Events
    1
  •  News and Updates
    55

 More details
  • CUNY Graduate Center
    Regular Faculty
New York City, New York, United States of America
Areas of Interest
Logic and Philosophy of Logic
European Philosophy
  • All publications (82)
  •  75
    Open days in set theory and arithmetic, Jachranka, Poland, 1986
    with Marian Srebrny
    Journal of Symbolic Logic 52 (3): 888-894. 1987.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, Miscellaneous
  •  153
    A certain class of models of peano arithmetic
    Journal of Symbolic Logic 48 (2): 311-320. 1983.
    Logic and Philosophy of LogicModel Theory
  •  80
    Minimal satisfaction classes with an application to rigid models of Peano arithmetic
    with James H. Schmerl
    Notre Dame Journal of Formal Logic 32 (3): 392-398. 1991.
    Logic and Philosophy of LogicModel Theory
  •  57
    The ω-like recursively saturated models of arithmetic
    Bulletin of the Section of Logic 20 (3/4): 109-109. 1991.
    Areas of Mathematics
  •  77
    Game approximations of satisfaction classes models
    with Henryk Kotlarski
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1): 21-26. 1992.
    Model Theory
  •  139
    Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics (edited book)
    with Åsa Hirvonen, Juha Kontinen, and Andrés Villaveces
    De Gruyter. 2015.
    In recent years, mathematical logic has developed in many directions, the initial unity of its subject matter giving way to a myriad of seemingly unrelated areas. The articles collected here, which range from historical scholarship to recent research in geometric model theory, squarely address this development. These articles also connect to the diverse work of Väänänen, whose ecumenical approach to logic reflects the unity of the discipline.
    Set TheoryLogic and Philosophy of LogicEthics
  •  52
    Preface – Unity and Diversity of Logic
    with Andrés Villaveces, Juha Kontinen, and Åsa Hirvonen
    In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, De Gruyter. 2015.
  •  84
    A note on satisfaction classes
    Notre Dame Journal of Formal Logic 26 (1): 1-8. 1985.
    Logic and Philosophy of LogicModel Theory
  •  68
    On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
    with Henryk Kotlarski and James H. Schmerl
    Annals of Pure and Applied Logic 65 (2): 125-148. 1993.
    We show that the stabilizer of an element a of a countable recursively saturated model of arithmetic M is a maximal subgroup of Aut iff the type of a is selective. This is a point of departure for a more detailed study of the relationship between pointwise and setwise stabilizers of certain subsets of M and the types of elements in those subsets. We also show that a complete type of PA is 2-indiscernible iff it is minimal in the sense of Gaifman
    Logic and Philosophy of LogicModel Theory
  •  103
    A note on the multiplicative semigroup of models of peano arithmetic
    with Mark Nadel and James Schmerl
    Journal of Symbolic Logic 54 (3): 936-940. 1989.
    Logic and Philosophy of LogicModel Theory
  •  65
    Recursively saturated $\omega_1$-like models of arithmetic
    Notre Dame Journal of Formal Logic 26 (4): 413-422. 1985.
    Logic and Philosophy of LogicModel Theory
  •  47
    The Notre Dame Lectures (review)
    Bulletin of Symbolic Logic 12 (4): 605-607. 2006.
  •  165
    Models with the ω-property
    Journal of Symbolic Logic 54 (1): 177-189. 1989.
    A model M of PA has the omega-property if it has a subset of order type omega that is coded in an elementary end extension of M. All countable recursively saturated models have the omega-property, but there are also models with the omega-property that are not recursively saturated. The papers is devoted to the study of structural properties of such models.
    Logic and Philosophy of LogicModel Theory
  •  120
    Automorphism group actions on trees
    with Alexandre Ivanov
    Mathematical Logic Quarterly 50 (1): 71. 2004.
    We study the situation when the automorphism group of a recursively saturated structure acts on an ℝ-tree. The cases of and models of Peano Arithmetic are central in the paper
    Model Theory
  •  84
    Arithmetically Saturated Models of Arithmetic
    with James H. Schmerl
    Notre Dame Journal of Formal Logic 36 (4): 531-546. 1995.
    The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructur…Read more
    The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures
    Logic and Philosophy of LogicModel Theory
  •  72
    On two questions concerning the automorphism groups of countable recursively saturated models of PA
    with Nicholas Bamber
    Archive for Mathematical Logic 36 (1): 73-79. 1996.
    Model Theory
  •  52
    A note on a theorem of Kanovei
    Archive for Mathematical Logic 43 (4): 565-569. 2004.
    We give a short proof of a theorem of Kanovei on separating induction and collection schemes for Σ n formulas using families of subsets of countable models of arithmetic coded in elementary end extensions
    Areas of Mathematics
  •  96
    A Note on BΣn and an Intermediate Induction Schema
    with Zofia Adamowicz
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (3): 261-264. 1988.
    Areas of Mathematics
  •  48
    A Radio Interview with Jouko Väänänen
    with Andrés Villaveces, Juha Kontinen, and Åsa Hirvonen
    In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, De Gruyter. pp. 417-422. 2015.
  •  34
    The Structure of Models of Peano Arithmetic
    with James Schmerl
    Clarendon Press. 2006.
    Aimed at graduate students, research logicians and mathematicians, this much-awaited text covers over 40 years of work on relative classification theory for nonstandard models of arithmetic. The book covers basic isomorphism invariants: families of type realized in a model, lattices of elementary substructures and automorphism groups.
  •  78
    On Cofinal Submodels and Elementary Interstices
    with James H. Schmerl
    Notre Dame Journal of Formal Logic 53 (3): 267-287. 2012.
    We prove a number of results concerning the variety of first-order theories and isomorphism types of pairs of the form $(N,M)$ , where $N$ is a countable recursively saturated model of Peano Arithmetic and $M$ is its cofinal submodel. We identify two new isomorphism invariants for such pairs. In the strongest result we obtain continuum many theories of such pairs with the fixed greatest common initial segment of $N$ and $M$ and fixed lattice of interstructures $K$ , such that $M\prec K\prec N$
    Logic and Philosophy of LogicModel Theory
  •  79
    Automorphisms of recursively saturated models of arithmetic
    with Richard Kaye and Henryk Kotlarski
    Annals of Pure and Applied Logic 55 (1): 67-99. 1991.
    We give an examination of the automorphism group Aut of a countable recursively saturated model M of PA. The main result is a characterisation of strong elementary initial segments of M as the initial segments consisting of fixed points of automorphisms of M. As a corollary we prove that, for any consistent completion T of PA, there are recursively saturated countable models M1, M2 of T, such that Aut[ncong]Aut, as topological groups with a natural topology. Other results include a classificatio…Read more
    We give an examination of the automorphism group Aut of a countable recursively saturated model M of PA. The main result is a characterisation of strong elementary initial segments of M as the initial segments consisting of fixed points of automorphisms of M. As a corollary we prove that, for any consistent completion T of PA, there are recursively saturated countable models M1, M2 of T, such that Aut[ncong]Aut, as topological groups with a natural topology. Other results include a classification of the normal subgroups of Aut of the form [lcub]g: g [uharr] A = idA[rcub], for sets A M, and a highly homogeneous representation of Aut as a subgroup of Aut
    Logic and Philosophy of LogicModel Theory
  • Prev.
  • 1
  • 2
  • 3
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback