If you need an accessible version of this item please contact JSTOR User Support

A Construction of Non-Well-Founded Sets within Martin-Löf's Type Theory

Ingrid Lindström
The Journal of Symbolic Logic
Vol. 54, No. 1 (Mar., 1989), pp. 57-64
DOI: 10.2307/2275015
Stable URL: http://www.jstor.org/stable/2275015
Page Count: 8
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
A Construction of Non-Well-Founded Sets within Martin-Löf's Type Theory
Preview not available

Abstract

In this paper, we show that non-well-founded sets can be defined constructively by formalizing Hallnäs' limit definition of these within Martin-Löf's theory of types. A system is a type W together with an assignment of ᾱ ∈ U and α̃ ∈ ᾱ → W to each α ∈ W. We show that for any system W we can define an equivalence relation =w such that α =w β ∈ U and =w is the maximal bisimulation. Aczel's proof that CZF can be interpreted in the type V of iterative sets shows that if the system W satisfies an additional condition (*), then we can interpret CZF minus the set induction scheme in W. W is then extended to a complete system W* by taking limits of approximation chains. We show that in W* the antifoundation axiom AFA holds as well as the axioms of CFZ-.

Page Thumbnails

  • Thumbnail: Page 
57
    57
  • Thumbnail: Page 
58
    58
  • Thumbnail: Page 
59
    59
  • Thumbnail: Page 
60
    60
  • Thumbnail: Page 
61
    61
  • Thumbnail: Page 
62
    62
  • Thumbnail: Page 
63
    63
  • Thumbnail: Page 
64
    64