,
Discover new books on Goodreads
See if your friends have read any of Stephen Cole Kleene's books
Stephen Cole Kleene

Stephen Cole Kleene’s Followers (13)

member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo

Stephen Cole Kleene


Born
in Hartford, Connecticut, The United States
January 05, 1909

Died
January 25, 1994

Genre


Average rating: 4.41 · 96 ratings · 7 reviews · 22 distinct works
Mathematical Logic (Dover B...

4.37 avg rating — 59 ratings — published 1967 — 12 editions
Rate this book
Clear rating
Introduction to Metamathema...

4.40 avg rating — 35 ratings — published 1971 — 17 editions
Rate this book
Clear rating
Introduction to metamathema...

it was amazing 5.00 avg rating — 1 rating
Rate this book
Clear rating
Introduction To Metamathema...

it was amazing 5.00 avg rating — 1 rating
Rate this book
Clear rating
Mathematical logic

it was amazing 5.00 avg rating — 1 rating
Rate this book
Clear rating
Two Papers On The Predicate...

0.00 avg rating — 0 ratings — published 1997 — 2 editions
Rate this book
Clear rating
Formalized Recursive Functi...

0.00 avg rating — 0 ratings — published 1969
Rate this book
Clear rating
EOU Mathematical Logic (Dov...

0.00 avg rating — 0 ratings
Rate this book
Clear rating
Yoga et santé

0.00 avg rating — 0 ratings
Rate this book
Clear rating
Mathematical logic: Course ...

0.00 avg rating — 0 ratings
Rate this book
Clear rating
More books by Stephen Cole Kleene…
Quotes by Stephen Cole Kleene  (?)
Quotes are added by the Goodreads community and are not verified by Goodreads. (Learn more)

“An algorithm is a finite answer to an infinite number of questions.”
Stephen Cole Kleene

“An intuitive mathematics is necessary even to define the formal mathematics.”
Stephen Cole Kleene, Introduction to Metamathematics

“In classical mathematics there occur non-constructive or indirect existence proofs, which intuitionists do not accept. For example, to prove there exists an n such that P(n), the classical mathematician may deduce a contradiction from the assumption for all n, not P(n). Under both the classical and the intuitionistic logic, by reductio ad absurdum this gives not for all n, not P(n). The classical logic allows this result to be transformed into there exists an n such that P(n), but not in general the intuitionistic … the classical meaning, that somewhere in the completed infinite totality of the natural numbers there occurs an n such that P(n), is not available to him, since he does not conceive the natural numbers as a completed totality.”
Stephen Cole Kleene, Introduction to Metamathematics