A01=Raymond M. Smullyan
Arithmetic
Arithmetic function
Atomic sentence
Author_Raymond M. Smullyan
Axiom
Axiom A
Axiom schema
Axiomatic system
Binary relation
Cantor's diagonal argument
Cartesian product
Category=PBCD
Characterization (mathematics)
Chinese remainder theorem
Closure (mathematics)
Combination
Complement (set theory)
Concatenation theory
Corollary
Counterexample
Decidability (logic)
Decision problem
Definable set
Diagonalization
Direct proof
Disjoint sets
Enumeration
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Equation
Existential quantification
Exponential function
Formal system
Functional calculus
Godel numbering
Godel's incompleteness theorems
Herbrand's theorem
Inference
Logical connective
Logical consequence
Mathematical induction
Mathematical logic
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
Recursive set
Recursively enumerable set
Rule of inference
Scientific notation
Sequence
Set (mathematics)
Sign (mathematics)
Special case
Subset
System U
Theorem
Theory
Transfinite number
Turing machine
Universal set
Validity
Variable (mathematics)
Zermelo set theory
Product details
- ISBN 9780691080475
- Weight: 198g
- Dimensions: 152 x 229mm
- Publication Date: 21 Apr 1961
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
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.
