On two questions concerning the automorphism groups of countable recursively saturated models of PA
暂无分享,去创建一个
[1] Vladimir Kanovei. Uniqueness, Collection, and External Collapse of Cardinals in IST and Models of Peano Arithmetic , 1995, J. Symb. Log..
[2] Richard Kaye,et al. Automorphisms of Recursively Saturated Models of Arithmetic , 1991, Ann. Pure Appl. Log..
[3] Haim Gaifman,et al. Models and types of Peano's arithmetic , 1976 .
[4] James H. Schmerl,et al. On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA , 1993, Ann. Pure Appl. Logic.
[5] James H. Schmerl,et al. Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic , 1991, Notre Dame J. Formal Log..
[6] Roman Kossak. Four Problems Concerning Recursively Saturated Models of Arithmetic , 1995, Notre Dame J. Formal Log..
[7] A. M. W. Glass,et al. Ordered Permutation Groups , 1982 .
[8] Richard Kaye. Models of Peano arithmetic , 1991, Oxford logic guides.
[9] George Wilmers,et al. Models OF Peano Arithmetic (Oxford Logic Guides 15) , 1993 .