Volume 1104 1984

Computation and Proof Theory

Proceedings of the Logic Colloquium held in Aachen, July 18–23, 1983 Part II

ISBN: 978-3-540-13901-0 (Print) 978-3-540-39119-7 (Online)

Table of contents (21 chapters)

previous Page of 2
  1. No Access

    Book Chapter

    Pages 1-37

    Contiguous R.E. Degrees

  2. No Access

    Book Chapter

    Pages 39-62

    Abstract construction of counterexamples in recursive graph theory

  3. No Access

    Book Chapter

    Pages 63-77

    Minimal degrees and 1-generic sets below 0′

  4. No Access

    Book Chapter

    Pages 79-100

    Undecidability and recursive equivalence II

  5. No Access

    Book Chapter

    Pages 101-115

    Logical syntax and computational complexity

  6. No Access

    Book Chapter

    Pages 117-128

    Subrecursive hierarchies via direct limits

  7. No Access

    Book Chapter

    Pages 129-142

    A star-finite relational semantics for parallel programs

  8. No Access

    Book Chapter

    Pages 143-162

    Between constructive and classical mathematics

  9. No Access

    Book Chapter

    Pages 163-174

    Partial closures and semantics of while: Towards an iteration-based theory of data types

  10. No Access

    Book Chapter

    Pages 175-216

    Toward logic tailored for computational complexity

  11. No Access

    Book Chapter

    Pages 217-232

    On a new notion of partial conservativity

  12. No Access

    Book Chapter

    Pages 233-258

    Finitely approximable sets

  13. No Access

    Book Chapter

    Pages 259-278

    A unified approach to constructive and recursive analysis

  14. No Access

    Book Chapter

    Pages 279-288

    On faithful interpretability

  15. No Access

    Book Chapter

    Pages 289-364

    Abstract recursion as a foundation for the theory of algorithms

  16. No Access

    Book Chapter

    Pages 365-388

    Some logical problems connected with a modular decomposition theory of automata

  17. No Access

    Book Chapter

    Pages 389-398

    Diophantine equations in a fragment of number theory

  18. No Access

    Book Chapter

    Pages 399-426

    Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ν, ⊃, λ, ∀, ε

  19. No Access

    Book Chapter

    Pages 427-436

    On subsets of the Skolem class of exponential polynomials

  20. No Access

    Book Chapter

    Pages 437-451

    Effective operators in a topological setting

previous Page of 2