Kossak, Roman City University of New York
Schmerl, James University of Connecticut, Storrs
Print publication date: 2006 (this edition)
Published to Oxford Scholarship Online: September 2007
Print ISBN-13: 978-0-19-856827-8







doi:10.1093/acprof:oso/9780198568278.003.0005

Roman Kossak
James H. Schmerl
Abstract: This chapter makes use of an induced version of Ramsey's Theorem to prove several results: the Abramson-Harrington theorem on omitting large indiscernible sets and Hanf numbers for models of arithmetic; a theorem characterizing the possible automorphism groups of models; and a theorem based on countable recursively saturated models being generated by a set of indiscernibles.

Keywords: Ramsey's Theorem, Abramson-Harrington theorem, Hanf numbers, automorphism groups, indiscernibles,

You have access to the abstract for this item.     You have access to the full text for this item.



 










Quick Search Form

 
scroll up fast
scroll up
 
scroll down
scroll down fast