Computer Science Logic
Subtitle: 12th International Workshop, CSL'98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings (Lecture Notes in Computer Science)
Contributors: Georg Gottlob (Editor); Etienne Grandjean (Editor); Katrin Seyr (Editor)
Edition: 1 edition
Publisher: Springer
Published: June 11, 1999
Language: eng
Format: Paperback
Number of pages: 431
ISBN-13: 9783540659228
Subjects: Artificial intelligence; High level programming languages; Mathematical logic; Mathematical theory of computation; Programming - General; Congresses; Logic Programming; Computers; Computers - General Information; Science/Mathematics; Logic Design; General; Artificial Intelligence - General; Computational Complexity; Computer Science Logic; Fuzzy Logic; Induction; Mathematics / Logic; Logic; Computer logic
First sentence: It follows from Gödel's completeness theorem that the set of all tautologies of the classical (Boolean) predicate logic (denote this set by TAUTBool) is recursively enumerable, i. e.