Skip to main content
Conference ProceedingsOPEN ACCESS

On array theory of bounded elements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6174 LNCS 570-584
DOI: 10.1007/978-3-642-14295-6_50
3Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate a first-order array theory of bounded elements. By reducing to weak second-order logic with one successor (WS1S), we show that the proposed array theory is decidable. Finally, two natural extensions to the new theory are shown to be undecidable. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhou, M., He, F., Wang, B. Y., & Gu, M. (2010). On array theory of bounded elements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 570–584). https://doi.org/10.1007/978-3-642-14295-6_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free