Normal view MARC view ISBD view

Algorithmic structural completeness and a retrieval system for proving theorems in algorithmic theories

Biela, Andrzej

Algorithmic structural completeness and a retrieval system for proving theorems in algorithmic theories Andrzej Biela - Katowice Wydawn. Uniwersytetu âSlñaskiego 2000 - 121 p ill 25 cm - Prace naukowe Uniwersytetu âSlñaskiego w Katowicach nr. 1901 .

ISBN: 8322610238

LCCN: 2001515640

Subjects--Topical Terms:
Formal languages
Algorithms
Logic, Symbolic and mathematical
Automatic theorem proving

Dewey Class. No.: 511.3

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)