## Provability, Computability and ReflectionProvability, Computability and Reflection |

### What people are saying - Write a review

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

### Contents

Measurable cardinals | 19 |

Infinitary methods in the model theory of set theory | 53 |

On semisets | 67 |

Copyright | |

12 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract admissible ordinals analysis applied arguments arithmetic copy assume axioms Barwise BRFT characteristic function computation theory concept consider consistent construction Corollary countable defined denote domain elements equivalent existence extension FCN(M follows formal formula Friedberg theory G Field Gandy given Godel number Hence hierarchy hyperarithmetic hyperprojective inductive definition infinite isomorphic Kleene Kleene's Kripke language large cardinal Lemma mapping Math measurable cardinal metarecursion theory monadic Moschovakis natural numbers notation notion obtained operations ordinary recursion theory partial functions partial recursive functions pjn.v precomputation predicate prewellordering prime computable problem proof properties prove quantifiers r.e. sets rank realism recursion theory recursive ordinals recursive set recursively enumerable relation result satisfies schema second-order Section semicomputable semisets sense sentences sequence set theory sets of integers structure subset Suppose Symbolic Logic Theorem thesis tion total function Turing undefined uniformly variables well-ordering