Computation and proof theory : proceedings of the Logic Colloquium held in Aachen, July 18-23, 1983, part II

Author(s)

Bibliographic Information

Computation and proof theory : proceedings of the Logic Colloquium held in Aachen, July 18-23, 1983, part II

edited by M.M. Richter ... [et al.]

（Lecture notes in mathematics, 1104）

Springer-Verlag, 1984

  • : gw
  • : us

Other Title

Models and sets

Available at  / 72 libraries

Search this Book/Journal

Note

"Ein weiterer Band der Proceedings erscheint unter dem Titel "Models and Sets" ebenfalls in den Lencture Notes in Mathematics ... "

Includes bibliographies

Description and Table of Contents

Table of Contents

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.

by "Nielsen BookData"

Related Books： 1-1 of 1

Details

Page Top