## Formally Intuitionistic Set Theories with Bounded Predicates Decidable |

### What people are saying - Write a review

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

### Contents

Development of the Standard Results | 20 |

Realizability Interpretation of KL in KL | 55 |

Chapter k Godel Interpretation of KLg in KL | 68 |

4 other sections not shown

### Common terms and phrases

3x cp abbreviation analogous Aq-LEM AQ-Sep argument arithmetic Assume cp axiom axiom schema bounded predicates bounded quantifiers chapter classical logic Coll conjecture conservative extension conservative extension results construction Corollary cp cp cp f cp is strongly cp(z Dec-Sep defined Definition denote Dom(f equiconsistency equivalent fact FIST's Fld(r Fnc(f formula cp free variables Friedman given h cp Heyting's hierarchy holds hypothesis of RD implies induction on cp integer intuitionistic logic ISFC Lemma Let cp meta-recursion natural number Notation obtain ordinal pair positive formula Power Set Proof Proposition q-realizability quantifiers realizability Reflection Principle Remark s-m-n Theorem Say cp sentences set constants set theory syntactic TC(z Theorem Transfinite Recursive transitive set trivial truth predicates Type Theory verify well-ordering write