Mathematical logic. Foundations for information science (Q5920721): Difference between revisions

The book consists of two parts. The first part is written for undergraduate university students of computer science and presents the classical first-order predicate logic with set-theoretical interpretation of its formulas and a symmetrical, well-shaped, and beautiful Gentzen-type axiomatic system which describes identically true (tautological or valid) formulas of this logic. The main theorems of mathematical logic are proved: soundness and completeness theorems, Gödel's incompleteness and consistency theorems. Herbrand's models and Hintikka's sets are used in proofs. In concomitant questions of computability and representability in arithmetic of natural numbers, some form of a Pascal-like programming language is used. The second part may be used for a course for postgraduate students of information science and includes a definition of versions of a formal theory, version sequences and their limits. It formalizes revisions of formal theories, defines the concept of pro-scheme, and uses it to describe a methodology for the evolution of formal theories. It goes on to study inductive inference and describes the principles of a meta-language environment. These principles lead to an extension and further development of classical mathematical logic.