Normal view MARC view ISBD view

Enumerability decidability computability

By:

Material type: Text

TextPublication details: New York Springer-Verlag 1969Edition: 2nd edDescription: x, 245pDDC classification:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Book	JRD Tata Memorial Library	511.3 N693 (Browse shelf(Opens below))	Available		58841

Previous		No cover image available		No cover image available	No cover image available		No cover image available	Next
Previous	511.02462 N88 Numerical methods for engineers	511.2 P17 Analytic models, dilations, wandering subspaces and inner functions	511.3 GAN Mathematical logic	511.3 N693 Enumerability decidability computability an introduction to the theory of recursive functions	511.3 N87 Application of finite graph models of context fue languages.	511.3 N925 Proof theory a selection of papers from the Leeds Proof Theory Programme 1990	511.3 N97 Soundness and completeness results in partially-interpreted logics	Next

There are no comments on this title.

to post a comment.