As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Pseudorecursive varieties [16] strongly express a lack of recursive uniformity related to equational logic. This article suggests an abstraction of the notion and its integration with algebraic and computational studies—steps that may support or at least explicate Tarski's claim that the nonrecursive pseudorecursive equational theories are nonetheless decidable.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.