Abstract
The study of the decidability of the so-called sequential calculus S1S calls into play two techniques employing tools at the heart of Logic and Computer Science: Büchi automata on infinite words [1] and Shelah's composition method [10]. In this paper we continue along the line started by Thomas in [14] and we compare the decidability proofs for S1S also in a case in which the basic endowment of interpreted predicates is not restricted to
Cite
CITATION STYLE
Marzano, E., Montanari, A., & Policriti, A. (2004). Binary extensions of S1S and the composition method. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 626–644. https://doi.org/10.1007/978-3-540-39910-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
