On the Complexity of the Theories of Weak Direct Products
Let N be the set of nonnegative integers and let < N ,+> be the weak direct product of < N,+> with itself. Mostowski[ 9 ] shows that the theory of < N ,*> is decidable, but his decision procedure isn't elementary recursive. We present here a more efficient procedure which oper...
Main Author: | Rackoff, Charles |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148871 |
Similar Items
-
The Computational Complexity of Some Logical Theories
by: Rackoff, Charles Weill
Published: (2023) -
The computational complexity of logical theories /
by: 366280 Ferrante, Jeanne, et al.
Published: (1979) -
A Decision Procedure for the First Order Theory of Real Addition with Order
by: Ferrante, Jeanne, et al.
Published: (2023) -
The Emptiness and Complementation Problems for Automata on Infinite Trees
by: Rackoff, Charles Weill
Published: (2023) -
The Emptiness Problem for Automata on Infinite Trees
by: Hossley, Robert, et al.
Published: (2023)