Equality of streams is a Π0 over 2-complete problem

This paper gives a precise characterization for the complexity of the problem of proving equal two streams defined with a finite number of equations: Π0 over 2. Since the Π 0 over 2 class includes properly both the reursively enumerable and the corecursively enumerable classes, this result implies that neither the set of pairs of equal streams nor the set of pairs of unequal streams is recursively enumerable. Consequently, one can find no algorithm for determining equality of streams, as well as no algorithm for determining inequality of streams. In particular, there is no complete proof system for equality of streams and no complete system for inequality of streams.

[1]  Alexander Kurz,et al.  Observational logic, constructor-based logic, and their duality , 2003, Theor. Comput. Sci..

[2]  Jan J. M. M. Rutten,et al.  A tutorial on coinductive stream calculus and signal flow graphs , 2005, Theor. Comput. Sci..

[3]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[4]  Rolf Hennicker,et al.  Context Induction: a Proof Principle for Behavioural Abstractions , 1990, DISCO.

[5]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[6]  Jan A. Bergstra,et al.  Equational specifications, complete term rewriting systems, and computable and semicomputable algebras , 1995, JACM.

[7]  Joseph A. Goguen,et al.  Types as theories , 1991 .

[8]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[9]  Gernot Salzer,et al.  Automated Deduction in Classical and Non-Classical Logics , 2002, Lecture Notes in Computer Science.

[10]  J. H. Geuvers,et al.  Inductive and Coinductive Types with Iteration and Recursion , 1992 .

[11]  Grigore Rosu,et al.  Hidden Congruent Deduction , 1998, FTP.

[12]  Samuel R. Buss,et al.  Incompleteness of Behavioral Logics , 2000, CMCS.

[13]  Kenneth L Stoler.  A hidden agenda. , 2008, The New York state dental journal.

[14]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[15]  Rolf Hennicker,et al.  Context induction: A proof principle for behavioural abstractions and algebraic implementations , 1991, Formal Aspects of Computing.