Theory of Formal Systems (eBook)

Raymond M. Smullyan (Autor)

eBook Download: PDF

2016
156 Seiten
Princeton University Press (Verlag)
978-1-4008-8200-7 (ISBN)

Infos

This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.

Produkt-Details

• Erscheint lt. Verlag: 2.3.2016
• Reihe/Serie: Annals of Mathematics Studies
• Reihe/Serie: Annals of Mathematics Studies
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
• Themenwelt: Naturwissenschaften
• Themenwelt: Technik
• Schlagworte: Addition • Algebraic Geometry • Alonzo Church • arithmetic • Arithmetic function • Atomic sentence • Axiom • Axiom A • axiomatic system • Axiom schema • Binary Relation • Cantor's Diagonal Argument • Cartesian Product • Characterization (mathematics) • chinese remainder theorem • Closed-form expression • Closure (mathematics) • combination • Combinatory Logic • Complement (set theory) • Concatenation theory • consistency • Constructive proof • corollary • Countable set • counterexample • Decidability (logic) • Decision problem • definable set • Diagonalization • Direct proof • Disjoint sets • Enumeration • Equation • existential quantification • exponential function • Finite set • formal system • functional calculus • Gödel numbering • Gödel's Incompleteness Theorems • Herbrand's theorem • inference • Integer Factorization • Iteration • John Myhill • Logical connective • logical consequence • Mathematical Induction • Mathematical Logic • mathematician • Mathematics • metamathematics • Modus Ponens • Natural number • Negation • Number Theory • Order theory • Parity (mathematics) • Peano axioms • Predicate (mathematical logic) • Prenex normal form • Primitive Recursive Function • Quantifier (logic) • Recursion • Recursively enumerable set • Recursive set • remainder • Requirement • Rule of inference • scientific notation • Sequence • Set (mathematics) • Sign (mathematics) • Special case • Subset • Suggestion • System U • Theorem • theory • Transfinite number • Turing Machine • Universal set • Validity • Variable (mathematics) • Zermelo set theory
• ISBN-10: 1-4008-8200-1 / 1400882001
• ISBN-13: 978-1-4008-8200-7 / 9781400882007