Non-deterministic inductive definitions
From MaRDI portal
Publication:1935375
DOI10.1007/S00153-012-0309-4zbMATH Open1403.03111arXiv1104.2744OpenAlexW2064537710MaRDI QIDQ1935375FDOQ1935375
Publication date: 15 February 2013
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Abstract: We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification of this principle.
Full work available at URL: https://arxiv.org/abs/1104.2744
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some points in formal topology.
- Real and Ideal in Constructive Mathematics
- The axiom of multiple choice and models for constructive set theory
- The strength of some Martin-Löf type theories
- Wellfounded trees in categories
- Characterizing the interpretation of set theory in Martin-Löf type theory
- Aspects of general topology in constructive set theory
- Maximal and partial points in formal spaces
- Derived rules for predicative set theory: an application of sheaves
- Non-well-founded trees in categories
- Constructive completions of ordered sets, groups and fields
- Generalized geometric theories and set-generated classes
- Completeness and cocompleteness of the categories of basic pairs and concrete spaces
Cited In (6)
- Equivalents of the finitary non-deterministic inductive definitions
- Title not available (Why is that?)
- Generalized geometric theories and set-generated classes
- ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
- Variations on inductive-recursive definitions
- Eliminating disjunctions by disjunction elimination
This page was built for publication: Non-deterministic inductive definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935375)
