The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory

Authors:
Grégory Lafitte;Jacques Mazoyer
Affiliations:
-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 2
Cited 0

The infinite version of an open communication complexity problem is independent of the axioms of set theory

ACM SIGACT News
Borel sets and circuit complexity

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the infinite versions of the usual computational complexity questions LOGSPACE = P, NLOGSPACE = P by studying the comparison of their descriptive logics on infinite partially ordered structures rather than restricting ourselves to finite structures. We show that the infinite versions of those famous class separation questions are consistent with the axioms of set theory and we give a sufficient condition on the complexity classes in order to get other such relative consistency results.