Uniform inseparability in explicit mathematics

Journal of Symbolic Logic 64 (1):313-326 (1999)
We deal with ontological problems concerning basic systems of explicit mathematics, as formalized in Jäger's language of types and names. We prove a generalized inseparability lemma, which implies a form of Rice's theorem for types and a refutation of the strong power type axiom POW + . Next, we show that POW + can already be refuted on the basis of a weak uniform comprehension without complementation, and we present suitable optimal refinements of the remaining results within the weaker theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586767
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,660
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

23 ( #180,957 of 1,938,824 )

Recent downloads (6 months)

1 ( #458,338 of 1,938,824 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.