Titlebook: Logical Methods; In Honor of Anil Ner John N. Crossley,Jeffrey B. Remmel,Moss E. Sweedle Book 19931st edition Birkh�user Boston 1993 Equiva

Chronic

噱头

易于出错

火海

险代理人

压舱物

Index Sets in Recursive Combinatorics,and seeing if they can be made effective. The framework is recursion-theoretic. Typically, if a theorem has a noneffective proof, one would find a ‘recursive version’ of it and see if it is true. Usually the recursive version is false, hence the original proof is necessarily noneffective.

典型

Algorithmic Stability of Models,ind some conditions which are sufficient for systems to have the same uniform and program dimensions. In the second part the notion of . is given. We give an algebraic characterization of . systems in terms of notions of partially ordered sets, and investigate the problem of the number of recursive isomorphism types of finitely blocked models.

Interlocking

,Partial Automata and Finitely Generated Congruences: An Extension of Nerode’s Theorem,ne-to-one correspondence (up to isomorphism) with the finite partial automata on .. with no inaccessible and no inessential states. We give an application in term rewriting: every ground term rewrite system has a canonical equivalent system that can be constructed in polynomial time.

看法等

bronchiole

978-1-4612-6708-9Birkh�user Boston 1993