Book
Licensed
Unlicensed
Requires Authentication
Theory of Formal Systems
-
Raymond M. Smullyan
Language:
English
Published/Copyright:
1961
About this book
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.
Topics
|
Publicly Available Download PDF |
i |
|
Publicly Available Download PDF |
iii |
|
Requires Authentication Unlicensed Licensed Download PDF |
vii |
|
Requires Authentication Unlicensed Licensed Download PDF |
xiv |
|
Requires Authentication Unlicensed Licensed Download PDF |
1 |
|
Requires Authentication Unlicensed Licensed Download PDF |
19 |
|
Requires Authentication Unlicensed Licensed Download PDF |
39 |
|
Requires Authentication Unlicensed Licensed Download PDF |
65 |
|
Requires Authentication Unlicensed Licensed Download PDF |
93 |
|
Requires Authentication Unlicensed Licensed Download PDF |
127 |
|
Requires Authentication Unlicensed Licensed Download PDF |
141 |
Publishing information
Pages and Images/Illustrations in book
eBook published on:
March 2, 2016
eBook ISBN:
9781400882007
Pages and Images/Illustrations in book
Main content:
156
eBook ISBN:
9781400882007
Keywords for this book
Theorem; Predicate (mathematical logic); Axiom; Recursive set; Quantifier (logic); Existential quantification; Recursively enumerable set; Subset; Gödel numbering; Set (mathematics); Complement (set theory); Characterization (mathematics); Variable (mathematics); Herbrand's theorem; Sign (mathematics); Mathematical induction; Axiomatic system; Decidability (logic); Order theory; System U; Natural number; Inference; Axiom schema; Rule of inference; Cantor's diagonal argument; Closure (mathematics); Gödel's incompleteness theorems; Concatenation theory; Transfinite number; Mathematical logic; Number theory; Zermelo set theory; Peano axioms; Cartesian product; Parity (mathematics); Equation; Special case; Axiom A; Definable set; Turing machine; Direct proof; Theory; Primitive recursive function; Sequence; Logical connective; Prenex normal form; Modus ponens; Arithmetic function; Scientific notation; Enumeration; Formal system; Universal set; Functional calculus; Mathematics; Metamathematics; Counterexample; Corollary; Diagonalization; Validity; Arithmetic; Atomic sentence; Decision problem; Disjoint sets; Logical consequence; Chinese remainder theorem; Combination; Binary relation; Exponential function; Recursion; Negation
Audience(s) for this book
College/higher education;Professional and scholarly;
