Results 1 
4 of
4
The AntiFoundation Axiom In Constructive Set Theories
 Stanford University Press
, 2003
"... . The paper investigates the strength of the antifoundation axiom on the basis of various systems of constructive set theories. 1. Introduction Intrinsically circular phenomena have come to the attention of researchers in differing fields such as mathematical logic, computer science, artificial inte ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
. The paper investigates the strength of the antifoundation axiom on the basis of various systems of constructive set theories. 1. Introduction Intrinsically circular phenomena have come to the attention of researchers in differing fields such as mathematical logic, computer science, artificial intelligence, linguistics, cognitive science, and philosophy. Logicians first explored set theories whose universe contains what are called nonwellfounded sets, or hypersets (cf. [17], [5]). But the area was considered rather exotic until these theories were put to use in developing rigorous accounts of circular notions in computer science (cf. [7]). Instead of the Foundation Axiom these set theories adopt the socalled AntiFoundation Axiom, AFA, which gives rise to a rich universe of sets. AFA provides an elegant tool for modeling all sorts of circular phenomena. The application areas range from knowledge representation and theoretical economics to the semantics of natural language and pr...
Metapredicative And Explicit Mahlo: A ProofTheoretic Perspective
"... After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the
Inaccessible Set Axioms May Have Little Consistency Strength
 Annals of Pure and Applied Logic
"... . The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form V where is a strongly inaccessible cardinal and V denotes the  th level of the von Neumann hierarchy. Inaccessible sets figure prominently in cat ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form V where is a strongly inaccessible cardinal and V denotes the  th level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms heavily depends on the context in which they are embedded. The context here will be the theory CZF \Gamma of constructive Zermelo Fraenkel set theory but without 2  Induction (foundation). Let INAC be the statement that for every set there is an inaccessible set containing it. CZF \Gamma +INAC is a mathematically rich theory in which one can easily formalize Bishop style constructive mathematics and a great deal of category theory. CZF \Gamma + INAC also has a realizability interpretation in type theory whic...
Elementary constructive operational set theory. To appear in: Festschrift for Wolfram Pohlers, Ontos Verlag
"... Abstract. We introduce an operational set theory in the style of [5] and [17]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We introduce an operational set theory in the style of [5] and [17]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical of explicit mathematics [14]. In particular, one has nonextensional operations (or rules) alongside extensional constructive sets. Operations are in general partial and a limited form of self–application is permitted. The system we introduce here is a fully explicit, finitely axiomatised system of constructive sets and operations, which is shown to be as strong as HA. 1.