Login / Signup
The MSO+U theory of (N, <) is undecidable.
Mikolaj Bojanczyk
Pawel Parys
Szymon Torunczyk
Published in:
CoRR (2015)
Keyphrases
</>
real time
theoretical framework
databases
sufficient conditions
np complete
computational model
theoretical basis
database
data sets
relational databases
special case
decision problems
general theory