Computation and Proof Theory: Proceedings of the Logic Colloquium Held in Aachen, July 18-23, 1983, Part IIMichael M. Richter |
Contents
VORWORT | 1 |
B Benninghofen | 9 |
H G CARSTENS P PAPPINGHAUS | 39 |
Copyright | |
31 other sections not shown
Other editions - View all
Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983: Part ... M. M. Richter,E. Börger,W. Oberschelp No preview available - 1984 |
Common terms and phrases
1-generic algebra algorithm automata axioms basic sets binary bounded c)-conservative closure closure algebra complete construction contiguous degrees Corollary countable decision problem defined definition denote elements equivalent example exp exp explicit fact filter final topology finite structures finitely approximable first-order logic fixed point formula free variables function f given global predicates Hence implies induction infinite initial segment integers iteration least fixed point Lemma Math mathematical matroids mergesort monotone Moschovakis natural numbers notion operative partial function polynomial problem proof of Theorem properties provable prove PTIME r.e. degrees r.e. sets recursion spaces recursion theory recursive functions recursively enumerable relation representation requirements rules satisfies second-order logic sentence sequence sort stage s+1 star-finite subsets Suppose Theorem topology transclos tuple Turing degrees vocabulary