Computation and Proof Theory: Proceedings of the Logic Colloquium held in Aachen, July 18–23, 1983 Part II

Contiguous R.E. Degrees....Pages 1-37
Abstract construction of counterexamples in recursive graph theory....Pages 39-62
Minimal degrees and 1-generic sets below 0′....Pages 63-77
Undecidability and recursive equivalence II....Pages 79-100
Logical syntax and computational complexity....Pages 101-115
Subrecursive hierarchies via direct limits....Pages 117-128
A star-finite relational semantics for parallel programs....Pages 129-142
Between constructive and classical mathematics....Pages 143-162
Partial closures and semantics of while: Towards an iteration-based theory of data types....Pages 163-174
Toward logic tailored for computational complexity....Pages 175-216
On a new notion of partial conservativity....Pages 217-232
Finitely approximable sets....Pages 233-258
A unified approach to constructive and recursive analysis....Pages 259-278
On faithful interpretability....Pages 279-288
Abstract recursion as a foundation for the theory of algorithms....Pages 289-364
Some logical problems connected with a modular decomposition theory of automata....Pages 365-388
Diophantine equations in a fragment of number theory....Pages 389-398
Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ν, ⊃, λ, ∀, ε....Pages 399-426
On subsets of the Skolem class of exponential polynomials....Pages 427-436
Effective operators in a topological setting....Pages 437-451
An axiomatization of the apartness fragment of the theory DLO + of dense linear order....Pages 453-475