The computational complexity of some logical theories - Info and Reading Options
By Charles Weill Rackoff
"The computational complexity of some logical theories" was published by Massachusetts Institute of Technology, Project MAC in 1975 - Cambridge, Mass, it has 130 pages and the language of the book is English.
“The computational complexity of some logical theories” Metadata:
- Title: ➤ The computational complexity of some logical theories
- Author: Charles Weill Rackoff
- Language: English
- Number of Pages: 130
- Publisher: ➤ Massachusetts Institute of Technology, Project MAC
- Publish Date: 1975
- Publish Location: Cambridge, Mass
“The computational complexity of some logical theories” Subjects and Themes:
- Subjects: ➤ Logic, Symbolic and mathematical - Sequential machine theory - Symbolic and mathematical Logic
Edition Specifications:
- Pagination: 130 p. --
Edition Identifiers:
- The Open Library ID: OL19108719M - OL12642581W
AI-generated Review of “The computational complexity of some logical theories”:
Read “The computational complexity of some logical theories”:
Read “The computational complexity of some logical theories” by choosing from the options below.
Search for “The computational complexity of some logical theories” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “The computational complexity of some logical theories” in Libraries Near You:
Read or borrow “The computational complexity of some logical theories” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “The computational complexity of some logical theories” at a library near you.
Buy “The computational complexity of some logical theories” online:
Shop for “The computational complexity of some logical theories” on popular online marketplaces.
- Ebay: New and used books.