Книга: Hunter Geoffrey «Metalogic: An Introduction to the Metatheory of Standard First Order Logic»
Серия: "-" This work makes available to readers without specialized training in mathematics complete proofs of the fundamental metatheorems of standard (i. e., basically truth-functional) first order logic. Included is a complete proof, accessible to non-mathematicians, of the undecidability of first order logic, the most important fact about logic to emerge from the work of the last half-century. Hunter explains concepts of mathematics and set theory along the way for the benefit of non-mathematicians. He also provides ample exercises with comprehensive answers. Издательство: "California UP" (2012)
ISBN: 978-0-520-02356-7 Купить за 1404 руб в My-shop |
Другие книги автора:
Книга | Описание | Год | Цена | Тип книги |
---|---|---|---|---|
Metalogic: An Introduction to the Metatheory of Standard First Order Logic | This work makes available to readers without specialized training in mathematics complete proofs of the fundamental metatheorems of standard (i. e., basically truth-functional) first order logic… — California UP, Подробнее... | бумажная книга |
См. также в других словарях:
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Metalogic — is the study of the metatheory of logic. While logic is the study of the manner in which logical systems can be used to decide the correctness of arguments, metalogic studies the properties of the logical systems themselves.[1] According to… … Wikipedia
Formula (mathematical logic) — In mathematical logic, a formula is a type of abstract object a token of which is a symbol or string of symbols which may be interpreted as any meaningful unit (i.e. a name, an adjective, a proposition, a phrase, a string of names, a string of… … Wikipedia
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Entailment — For other uses, see Entail (disambiguation). In logic, entailment is a relation between a set of sentences (e.g.,[1] meaningfully declarative sentences or truthbearers) and a sentence. Let Γ be a set of one or more sentences; let S1 be the… … Wikipedia