Determinateness in the low protective hierarchy
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “Axiomatization of the forcing relation with an application to Peano Arithmetic”
Determinateness in the low protective hierarchy
Sentences with three quantifiers are decidable in set theory
Daniel Gogol (1979)
Fundamenta Mathematicae
Similarity:
On the axiom of determinateness
Jan Mycielski (1964)
Fundamenta Mathematicae
Similarity:
Iteration of -complete forcing notions not collapsing .
Rosłanowski, Andrzej, Shelah, Saharon (2001)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Measurable cardinals and analytic games
Donald Matrin (1970)
Fundamenta Mathematicae
Similarity:
On the netweight of subspaces
Krzysztof Ciesielski (1983)
Fundamenta Mathematicae
Similarity:
The Axiom of Determinateness and canonical measures
James Henle (1981)
Fundamenta Mathematicae
Similarity:
On the axiom of determinateness (II)
Jan Mycielski (1966)
Fundamenta Mathematicae
Similarity:
An application of games to the completeness problem for formalized theories
Andrzej Ehrenfeucht (1961)
Fundamenta Mathematicae
Similarity:
Three notes on the complexity of model checking fixpoint logic with chop
Martin Lange (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the modal -calculus with a sequential composition operator. It uses two known game-based characterisations to derive the following results: the combined model checking complexity as well as the data complexity of FLC are EXPTIME-complete. This is already the case for its alternation-free fragment. The expression complexity of FLC is trivially P-hard and limited from above by the complexity...