What’s Decidable about Sequences?

DOI10.1007/978-3-642-15643-4_11zbMath1305.68067arXiv1001.2100OpenAlexW3101105140MaRDI QIDQ4931288

Carlo A. Furia

Publication date: 4 October 2010

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.2100

zbMATH Keywords

first-order theory of sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Data structures (68P05)

Related Items (1)

Array theory of bounded elements and its applications

This page was built for publication: What’s Decidable about Sequences?