My Account Log in

3 options

Computation and Proof Theory : Proceedings of the Logic Colloquium held in Aachen, July 18-23, 1983 Part II / edited by Egon Börger, Walter Oberschelp, Michael M. Richter, Brigitta Schinzel, Wolfgang Thomas.

Online

Available online

View online
Math/Physics/Astronomy Library QA3 .L28 v.1-999 470,523,830,849:2nd ed. v.1000-1722,1762,1781,1799-2099,2100-2192-2218 2219-2223-2258,2260-2271,2273-2274-2277,2279-2281,2283-2289,2291,2293-2294,2296,2298-2299,2300-2311,2313-2366,2368-2379,2381-2382 2385,2388-2389
Loading location information...

Mixed Availability Some items are available, others may be requested.

Log in to request item
LIBRA QA3 .L28 Scattered vols.
Loading location information...

Mixed Availability Some items are available, others may be requested.

Log in to request item
Format:
Book
Contributor:
Börger, E. (Egon), 1946- editor.
Oberschelp, Walter, 1933- editor.
Richter, Michael M., 1938- editor.
Schinzel, Brigitta, editor.
Thomas, Wolfgang, 1947- editor.
SpringerLink (Online service)
Series:
Lecture Notes in Mathematics, 0075-8434 ; 1104.
Lecture Notes in Mathematics, 0075-8434 ; 1104
Language:
English
Subjects (All):
Logic, Symbolic and mathematical.
Mathematical Logic and Foundations.
Local Subjects:
Mathematical Logic and Foundations.
Physical Description:
1 online resource (X, 482 pages).
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1984.
System Details:
text file PDF
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 and, ?, ?, ?, ?, ?
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.
Other Format:
Printed edition:
ISBN:
9783540391197
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account