Order and Recursion in Topoi

Front Cover
Department of Pure Mathematics, S.G.S., Australian National University, 1977 - Recursion theory - 226 pages
0 Reviews
Reviews aren't verified, but Google checks for and removes fake content when it's identified

From inside the book

 

What people are saying - Write a review

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

Contents

INTRODUCTION
1
1
43
The logic of topoi
59
Copyright

6 other sections not shown

Common terms and phrases

A X A Applying Axiom boolean topos called cartesian closed category of sets CHAPTER choice clearly coequalizer commute complement composite construction Conversely coproduct COROLLARY defined definition denoted diagram element equalizer equivalent example factors false functor given gives hence Heyting algebra identity implies internal isomorphism least LEMMA limits logic map g Math mono natural numbers object non-empty obtained Ofin order finite object pair partial map partial order Proof provides pullback recursion reflective subcategory reflects reflexive relation result right adjoint RX A X B splits square statement Street order subobject sufficient Suppose takes THEOREM topoi topos with natural transitive true unique map University yields Га РА

Bibliographic information

QR code for Order and Recursion in Topoi
TitleOrder and Recursion in Topoi
Volume 9 of Notes on pure mathematics
AuthorTim Brook
PublisherDepartment of Pure Mathematics, S.G.S., Australian National University, 1977
Original fromthe University of Michigan
DigitizedFeb 3, 2010
ISBN0708110495, 9780708110492
Length226 pages
  
Export CitationBiBTeX EndNote RefMan