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

CHIDE

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.

Neonatal

Computability in Unitary Representations of Compact Groups,ntation into its irreducible parts. Difficulties in finding the effective procedure are caused by the absolute lack of .. information about the irreducible representations and the obligation of making decisions from inexact data. Several lemmas on group representations (classical, i.e. computability

bibliophile

Recursive Properties of Intervals of Recursive Linear Orders,ith a co-r.e. interval .. We characterize those . for which there exists a recursive linear order ℬ and an isomorphism .: ℬ ≅ . such that ... is (a) not r.e.; (b) immune; (c) hyperimmune. We give general sufficient conditions for . and the subset . under which there exist such ℬ and . with ..(P) exh

暗语

Noisome

The Combinatorics of the Friedberg-Muchnick Theorem,ority proofs can be found in [11]. To this date, this part of recursion theory is at about the same stage of development as real analysis was in the early days, when the notions of topology, continuity, compactness, vector space, inner product space, etc., were not invented. There were no general th

Conclave

,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.

Bravado

Intuitionistic L, V = L and also of IZF. While these are not exciting results classically, they and their associated lemmas are examples of the phenomenon that classical trivialities can become sticky intuitionistically, when they are not downright false.

星星

n-Recursive Linear Orders without (n+1)-Recursive Copies,ive relations in the structure. This concept generalizes to that of an .-recursive structure, in which the Σ. formulae uniformly denote recursive relations. I present a sequence of simply defined relations in the language of linear order and show that a recursive linear order of type ω. (with . < ω)

agnostic

Coterminous