## Logic year 1979-80, the University of Connecticut, USAManuel Lerman, James Henry Schmerl, Robert Irving Soare |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Baldwin John | |

Berline C and Cherlin | 16 |

Epstein Richard L Haas Richard and Kramer Richard L | 32 |

Copyright | |

17 other sections not shown

### Common terms and phrases

a-cardinal abelian algebraically closed assume automorphism axioms cardinality characterization classless codes a standard cofinal Comprehension Schema computations conj consistent construction contradiction Corollary countable define definition denote doubly homogeneous E-coded element elementarily equivalent elementary end extension equivalent exists finite fixed follows formula functor gate G hence hyperarithmetic implies indexed family infinite integers interval isomorphic language Lemma Let G linear orderings Math minimal pair model of arithmetic model theory morphism Moschovakis nice code notation order types order-type ordinal p-group p-model parameters prewellordering prime filter prime-generated proof of Theorem prove quantifiers r.e. degrees r.e. set recursion theory recursive functions recursive set recursively enumerable recursively saturated relations result satisfaction class satisfies saturated model SEC[E sequence stage s+1 structure subobject subset Suppose Theorem Theorem 1.1 topology topos Turing degree