search for books and compare prices
Tables of Contents for Solvability, Provability, Definability
Chapter/Section Title
Page #
Page Count
Preface
vii
Bibliography of Emil L. Post
viii
Introduction
xi
The generalized gamma functions
1
16
Discussion of problem 433
17
4
Introduction to a general theory of elementary propositions
21
23
Generalized differentiation
44
59
Finite combinatory processes - Formulation I
103
3
Polyadic groups
106
143
The two-valued iterative systems of mathematical logic
249
126
Absolutely unsolvable problems and relatively undecidable propositions - account of an anticipation
375
67
Formal reductions of the general combinatorial decision problem
442
19
Recursively enumerable sets of positive integers and their decision problems
461
34
A variant of recursively unsolvable problem
495
6
Note on a conjecture of Skolem
501
2
Recursive unsolvability of a problem of Thue
503
11
(with S. C. Kleene) The upper semi-lattice of degrees of recursive unsolvability
514
31
Abstracts
Introduction to a general theory of elementary propositions
545
1
Determination of all closed systems of truth tables
545
1
On a simple class of deductive systems
545
1
Visual intuition in Lobachevsky space
546
1
Visual intuition in spherical and elliptic space: Einstein's finite universe
546
1
A non-Weierstrassian method of analytic prolongation
546
1
A new method for generalizing ex in the complex domain
547
1
A simple geometric proof of the equality of the Brochardt angles of a triangle
547
1
Theory of generalized differentiation
547
1
The mth derivative of a function of a function; calculus of mth derivatives
547
1
Polyadic groups (preliminary report)
548
1
Finite commbinatory processes. Formulation I
548
1
Recursive unsolvability of a problem of Thue
549
1
Degrees of recursive unsolvability (preliminary report)
549
1
(with Samuel Linial) Recursive unsolvability of the deducibility, Tarski's completeness, and independence of axioms problems of propositional calculus
550
1
Note on a relation recursion calculus
550
1
Solvability, definability, provability, history of an error
551
1
A necessary condition for definability for transfinite von Neumann-Godel set theory sets, with an application to the problem of the existence of a definable well-ordering of the continuum (preliminary report)
551
1
(with S. C. Kleene) The upper semi-lattice of degrees of recursive unsolvability
552
1
Permissions
553
<