Finitely axiomatizable theories Mikhail G. Peretyatʹkin

By:

Publication details: New York Consultants Bureau c1997Description: xiv, 294 p. : ill. ; 24 cmISBN:

ISSN:

Subject(s):

DDC classification:

Item type: Books

Tags from this library: No tags from this library for this title.

Average rating: 0.0 (0 votes)

Holdings
Current library	Call number	Status	Date due	Barcode
Anna Centenary Library	511.35 PER (Browse shelf(Opens below))	Available		301489

Previous	No cover image available			No cover image available				Next
Previous	511.35 ODI Classical recursion theory : the theory of functions and sets of natural numbers	511.35 PAU Fundamentals of Computation Theory	511.35 PAU Fundamentals of Computation Theory	511.35 PER Finitely axiomatizable theories	511.35 ROC The parametric lambda calculus : a meta-model for computation	511.35 SAK Elements of automata theory	511.35 SAX Automata Theory, Languages of Machines and Computability	Next

Includes bibliographical references (p. 289-292) and index

There are no comments on this title.

to post a comment.

Find us on the map