Книга: Hunter Geoffrey «Metalogic: An Introduction to the Metatheory of Standard First Order Logic»

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 LogicThis 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, Подробнее...20121816бумажная книга

См. также в других словарях:

  • 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

  • Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… …   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

  • Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 …   Wikipedia

  • Formal interpretation — A formal interpretation [http://books.google.com/books?id=weKqT3ka5g0C pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… …   Wikipedia

  • Metalanguage — For the programming language, see ML (programming language). Broadly, any metalanguage is language or symbols used when language itself is being discussed or examined.[1] In logic and linguistics, a metalanguage is a language used to make… …   Wikipedia

  • Deductive system — A deductive system (also called a deductive apparatus of a formal system) consists of the axioms (or axiom schemata) and rules of inference that can be used to derive the theorems of the system.[1] Such a deductive system is intended to preserve… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»