SIGN IN
SIGN UP
Existential second-order logic over strings
Full Text:
PDF
Buy this Article
Authors:
Thomas Eiter
Technische Univ. Wien, Vienna, Austria
Georg Gottlob
Technische Univ. Wien, Vienna, Austria
Yuri Gurevich
Microsoft Research, Redmond, Washington
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 47 Issue 1, Jan. 2000
Pages 77-131
ACM
New York, NY
, USA
table of contents
doi>
10.1145/331605.331609
2000 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 27
· Downloads (cumulative): 794
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
automata
classes defined by grammars or automata
computational logic
computations on discrete structures
decision problem
descriptive complexity
existential fragment
finite model theory
finite satisfiability
finite words
languages
model checking
model theory
np
prefix classes
regular languages
relations between models
s1s
second-order logic
strings
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder