• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
  • ورود / ثبت نام

عنوان
Algebraic computability and enumeration models : recursion theory and descriptive complexity

پدید آورنده
Nourani, Cyrus F.

موضوع
، Functor theory,، Model theory,، Computable functions,، Algebra, Homological,، Kleene algebra

رده
QA
169
.
N68A4

کتابخانه
Library of Institute for Research in Fundamental Sciences

محل استقرار
استان: Tehran ـ شهر: Tehran

Library of Institute for Research in Fundamental Sciences

تماس با کتابخانه : 22291812-021

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Algebraic computability and enumeration models : recursion theory and descriptive complexity

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Oakville, ON
Name of Publisher, Distributor, etc.
Apple Academic Press
Date of Publication, Distribution, etc.
c2016

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
xiv, 295 p.

GENERAL NOTES

Text of Note
Includes bibliographies
Text of Note
ISBN: 9781771882477

NOTES PERTAINING TO TITLE AND STATEMENT OF RESPONSIBILITY

Text of Note
Cyrus F. Nourani

ORIGINAL VERSION NOTE

Text of Note
1

TOPICAL NAME USED AS SUBJECT

Entry Element
، Functor theory
Entry Element
، Model theory
Entry Element
، Computable functions
Entry Element
، Algebra, Homological
Entry Element
، Kleene algebra

LIBRARY OF CONGRESS CLASSIFICATION

Class number
QA
169
.
N68A4

PERSONAL NAME - PRIMARY RESPONSIBILITY

Entry Element
Nourani, Cyrus F.
Relator Code
AU

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival