Lévy hierarchy in weak set theories

Journal of Philosophical Logic 37 (2):121 - 140 (2008)
We investigate the interactions of formula complexity in weak set theories with the axioms available there. In particular, we show that swapping bounded and unbounded quantification preserves formula complexity in presence of the axiom of foundation weakened to an arbitrary set base, while it does not if the axiom of foundation is further weakened to a proper class base. More attention is being paid to the necessary axioms employed in the positive results, than to the combinatorial strength of the positive results themselves.
Keywords axiom of foundation  quantifier complexity  weak set theory
Categories (categorize this paper)
DOI 10.2307/41217828
 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: 15,822
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

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

12 ( #200,185 of 1,724,742 )

Recent downloads (6 months)

7 ( #93,245 of 1,724,742 )

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.