The number of countable models of a theory of one unary function
Leo Marcus (1980)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Vaught's conjecture for theories of one unary operation”
The number of countable models of a theory of one unary function
equivalence between countable and uncountable linear orderings
Charles Landraitis (1980)
Fundamenta Mathematicae
Similarity:
ω-Trees in stationary logic
A. Baudisch, D. Sesse, H. Tuschik (1983)
Fundamenta Mathematicae
Similarity:
Determinateness in the low protective hierarchy
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
A Cantor-Bendixson theorem for the space
Jouko Väänänen (1991)
Fundamenta Mathematicae
Similarity:
Indicators, recursive saturation and expandability
L. Kirby, K. McAllon, R. Murawski (1981)
Fundamenta Mathematicae
Similarity:
Scott sentences and a problem of Vaught for mono-uary algebras
Stanley Burris (1973)
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...