The number of countable models of a theory of one unary function
Leo Marcus (1980)
Fundamenta Mathematicae
Similarity:
Leo Marcus (1980)
Fundamenta Mathematicae
Similarity:
Charles Landraitis (1980)
Fundamenta Mathematicae
Similarity:
A. Baudisch, D. Sesse, H. Tuschik (1983)
Fundamenta Mathematicae
Similarity:
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
Jouko Väänänen (1991)
Fundamenta Mathematicae
Similarity:
L. Kirby, K. McAllon, R. Murawski (1981)
Fundamenta Mathematicae
Similarity:
Stanley Burris (1973)
Fundamenta Mathematicae
Similarity:
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...