Recursive Algebra, Analysis and CombinatoricsRecursive Algebra, Analysis and Combinatorics |
Common terms and phrases
abelian groups antichains arithmetic arithmetic hierarchy binary bipartite graph Boolean algebras Cenzer coloring combinatorics computable linear ordering computably enumerable Corollary countable define Definition denote elements equivalent erists function f given graph G Hence highly recursive graph index sets induction infinite paths J. B. Remmel Jockusch k-colorable Khisamiev Kierstead König's Lemma lattice Lemma linear ordering Math natural numbers Nerode nonempty one-to-one order type ordered sets p-group p-time polynomial polynomial-time computable poset prime ideal problem Proc proof prove Pure Appl r.e. set Ramsey's Theorem real function real numbers recursion theory recursive function recursive linear ordering Recursive Mathematics recursive partial order recursive set recursive tree recursively bounded recursively enumerable recursively isomorphic Remmel Rosenstein Section sequence solution stage structure subgroup subset substructure Suppose Symbolic Logic Theorem torsion-free Turing Turing degree Univ vertex vertices width
Popular passages
Page xxxvii - H. Friedman, SG Simpson, and RL Smith, Countable algebra and set existence axioms, Annals of Pure and Applied Logic 25 (1983), pp.
References to this book
STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science ... Helmut Alt,Afonso Ferreira No preview available - 2002 |