TY  - BOOK
AU  - Börger,Egon
AU  - Oberschelp,Walter
AU  - Richter,Michael M.
AU  - Schinzel,Brigitta
AU  - Thomas,Wolfgang
ED  - SpringerLink (Online service)
TI  - Computation and Proof Theory: Proceedings of the Logic Colloquium held in Aachen, July 18–23, 1983 Part II 
T2  - Lecture Notes in Mathematics,
SN  - 9783540391197
AV  - QA8.9-10.3 
U1  - 511.3 23
PY  - 1984///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Mathematics
KW  - Logic, Symbolic and mathematical
KW  - Mathematical Logic and Foundations
N1  - Contiguous R.E. Degrees -- Abstract construction of counterexamples in recursive graph theory -- Minimal degrees and 1-generic sets below 0? -- Undecidability and recursive equivalence II -- Logical syntax and computational complexity -- Subrecursive hierarchies via direct limits -- A star-finite relational semantics for parallel programs -- Between constructive and classical mathematics -- Partial closures and semantics of while: Towards an iteration-based theory of data types -- Toward logic tailored for computational complexity -- On a new notion of partial conservativity -- Finitely approximable sets -- A unified approach to constructive and recursive analysis -- On faithful interpretability -- Abstract recursion as a foundation for the theory of algorithms -- Some logical problems connected with a modular decomposition theory of automata -- Diophantine equations in a fragment of number theory -- Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ?, ?, ?, ?, ? -- On subsets of the Skolem class of exponential polynomials -- Effective operators in a topological setting -- An axiomatization of the apartness fragment of the theory DLO+ of dense linear order
UR  - http://dx.doi.org/10.1007/BFb0099476
ER  -