
	Where results make sense

Topic: Stephen Cole Kleene

Related Topics

Stephen Kleene

Kleene algebra

Kleene closure

Philosophy of mathematics

Alonzo Church

Western philosophy

Regular expression

Lars Valerian Ahlfors

John von Neumann

Charles Peirce

Alan Turing

Hartford, Connecticut

2 (number)

Connecticut

Winnie Mandela

In the News (Fri 11 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Stephen Cole Kleene - Biocrawler
		Stephen Cole Kleene (January 5, 1909 - January 25, 1994) was an American mathematician whose work at the University of Wisconsin-Madison helped lay the foundations for theoretical computer science.
		Kleene was best known for founding the branch of mathematical logic known as recursion theory together with Alonzo Church, Kurt Gödel, Alan Turing and others; and for inventing regular expressions.
		Kleene's standing in mathematical logic is reflected in the proverb "Kleeneliness is next to Gödeliness" among logicians.
	www.biocrawler.com /encyclopedia/Stephen_Cole_Kleene (443 words)

	Stephen Cole Kleene - Wikipedia, the free encyclopedia
		Kleene was best known for founding the branch of mathematical logic known as recursion theory together with Alonzo Church, Kurt Gödel, Alan Turing and others; and for inventing regular expressions.
		Kleene's standing in mathematical logic is reflected in the proverb "Kleeneliness is next to Gödeliness" among logicians (a pun on "Cleanliness is next to godliness").
		S.C. Kleene's Bibliography – from University of Wisconsin
	en.wikipedia.org /wiki/Stephen_Cole_Kleene (510 words)

	Kleene biography
		Kleene's research was on the theory of algorithms and recursive functions.
		Kleene's formulation of computable function via six schemata is one of the most succinct and useful, and his previous work on lambda functions played a major role in supporting Church's Thesis that these classes coincide with the intuitively calculable functions.
		Kleene developed a diverse array of topics in computability: the arithmetical hierarchy, degrees of computability, computable ordinals and hyperarithmetic theory, finite automata and regular sets with enormous consequences for computer science, computability on higher types, recursive realizability for intuitionistic arithmetic with consequences for philosphy and for program correctness in computer science.
	www-history.mcs.st-andrews.ac.uk /Biographies/Kleene.html (346 words)

	Stephen Cole Kleene (Site not responding. Last check: 2007-10-19)
		Stephen Cole Kleene (pronounced "KLAY-nee") was born on January 5, 1909 in Hartford, Connecticut.
		Steve Kleene was one of the pioneers of 20th century mathematics.
		In 1990 Kleene was awarded the President's National Medal of Science, the country's highest scientific honor, for his leadership in the theory of recursion and effective computability and for developing it into a deep and broad field of mathematical research.
	math.library.wisc.edu /kleene.htm (552 words)

	Kleene algebra (Site not responding. Last check: 2007-10-19)
		A Kleene algebra is a set A together with two binary operations + : A × A → A and · : A × A → A and one function * : A → A, written as a + b, ab and a* respectively, so that the following axioms are satisfied.
		In fact, this is a "free" Kleene algebra in the sense that any equation among regular expressions follows from the Kleene algebra axioms and is therefore valid in every Kleene algebra.
		Kleene algebras were not defined by Kleene; he introduced regular expressions and asked for a set of axioms which would allow to derive all equations among regular expressions.
	bopedia.com /en/wikipedia/k/kl/kleene_algebra.html (1104 words)

	Stephen Cole Kleene
		Stephen Cole Kleene (January 5, 1909 - January 25, 1994) was an American mathematician whose work at the University of Wisconsin - Madison helped lay the foundations for theoretical computer science.
		By providing methods of determining which problems are soluble, Kleene's work led to the study of which functions are computable.
		The Kleene star, Kleene's recursion theorem and the Ascending Kleene Chain[?] are named after him.
	www.ebroadcast.com.au /lookup/encyclopedia/kl/Kleene,_Stephen_Cole.html (381 words)

	Stephen Cole Kleene, January 5, 1909—January 25, 1994 \| By Saunders Mac Lane \| Biographical Memoirs
		Kleene and his fellow student Barkley Rosser studied it with care, and presently found that it led to a contradiction.
		Much of Kleene's subsequent work was devoted to the systematic study of this class of recursive (computable) functions, as well represented in his magnificent 1952 book Introduction to Metamathematics and his treatment of the partial recursive functions--those defined recursively, but only for some numbers, hence partial.
		Kleene was elected to membership in the National Academy of Sciences in 1969.
	newton.nap.edu /html/biomems/skleene.html (1566 words)

	Amazon.com: Mathematical Logic: Books: Stephen Cole Kleene
		Kleene does not even make a pretense of holding the reader's hand: either you get it or you don't.
		Kleene is brilliant and painstakingly accurate--sometimes I forget he is human.
		Maybe it's not 'Mathematical Logic for Dummies', but Kleene would probably crack that dummies shouldn't be attempting the subject in the first place.
	www.amazon.com /Mathematical-Logic-Stephen-Cole-Kleene/dp/0486425339 (1006 words)

	Kleene biography
		Kleene's research was on the theory of algorithms and recursive functions.
		Kleene's formulation of computable function via six schemata is one of the most succinct and useful, and his previous work on lambda functions played a major role in supporting Church's Thesis that these classes coincide with the intuitively calculable functions.
		Kleene developed a diverse array of topics in computability: the arithmetical hierarchy, degrees of computability, computable ordinals and hyperarithmetic theory, finite automata and regular sets with enormous consequences for computer science, computability on higher types, recursive realizability for intuitionistic arithmetic with consequences for philosphy and for program correctness in computer science.
	www-groups.dcs.st-and.ac.uk /~history/Biographies/Kleene.html (338 words)

	UW Math PhD Alumni (Advisor: Kleene)
		Kleene first came to Madison in 1935 as an instructor and in 1937 was promoted to assistant professor.
		Kleene was the Dean of the College of Letters and Science from 1969 to 1974.
		In 1990 Steve Kleene won the National medal of Science, the country's highest scientific honor, for his leadership in the theory of recursion and effective computability and for developing it into a deep and broad field of mathematical research.
	www.math.wisc.edu /directories/alumni/bio-kleene.htm (442 words)

	Kleene algebra
		In mathematics, a Kleene algebra (named after Stephen Cole Kleene, pronounced "klay nee") is either of two different things:
		Here we will give the definition that seems to be the most common nowadays.
		We consider two such regular expressions equal if they describe the same language.
	www.ebroadcast.com.au /lookup/encyclopedia/kl/Kleene_algebra.html (1092 words)

	Kleene algebra: Facts and details from Encyclopedia Topic (Site not responding. Last check: 2007-10-19)
		Stephen cole kleene (january 5, 1909 - january 25, 1994) was an american mathematician whose work at the university of wisconsin-madison helped...
		The notion of a set is one of the most important and fundamental concepts in modern mathematics....
		In mathematical logic and computer science, the kleene star (or kleene closure) is a unary operation, either on sets of stringstrings or on sets...
	www.absoluteastronomy.com /encyclopedia/k/kl/kleene_algebra.htm (2703 words)

	Read about Stephen Cole Kleene at WorldVillage Encyclopedia. Research Stephen Cole Kleene and learn about Stephen Cole ... (Site not responding. Last check: 2007-10-19)
		Kleene was best known for founding the branch of
		During World War II, Kleene was a lieutenant commander in the
		An avid mountain climber, Kleene had a strong interest in nature and the
	encyclopedia.worldvillage.com /s/b/Stephen_Cole_Kleene (341 words)

	Stephen Kleene from FOLDOC
		Kleene was best known for founding the branch of mathematical logic known as recursion theory and for inventing regular expressions.
		The Kleene star and Ascending Kleene Chain are named after him.
		His son, Ken Kleene , wrote: "As far as I am aware this pronunciation is incorrect in all known languages.
	winnie.kuis.kyoto-u.ac.jp /foldoc/foldoc.cgi?Kleene,StephenCole (347 words)

	Stephen Kleene (Site not responding. Last check: 2007-10-19)
		Stephen Cole Kleene was born on January 5, 1909 in Hartford, Connecticut.
		In a 1956 paper, Kleene introduced the notion of regular expression, and proved that the languages specified by regular expressions and the languages generated by finite automata constituted the same class, a basic result today known as Kleene's Theorem.
		Kleene died in Madison, Wisconsin on January 25, 1994.
	www.student.cs.uwaterloo.ca /~cs360/Resources/Hall/kleene.html (144 words)

	Stephen Cole Kleene: biography and encyclopedia article (Site not responding. Last check: 2007-10-19)
		Kleene was best known for founding the branch of mathematical logic mathematical logic quick summary:
		Kleenes recursion theorem is a result in computability theory first proved by stephen kleene; it allows to construct programs, turing machines and recursive...
		In mathematics, the kleene fixpoint theorem in order theory states that given any complete lattice l, and a monotone function...
	www.absoluteastronomy.com /enc3/stephen_cole_kleene (1659 words)

	DBLP: Stephen Cole Kleene (Site not responding. Last check: 2007-10-19)
		Stephen Cole Kleene: An Addendum to The Work of Kurt Gödel. J.
		Stephen Cole Kleene: An Addendum: Disjunction and Existence Under Implication in Elementary Intuitionistic Formalisms.
		Stephen Cole Kleene: Disjunction and Existence Under Implication in Elementary Intuitionistic Formalisms.
	www.sigmod.org /dblp/db/indices/a-tree/k/Kleene:Stephen_Cole.html (123 words)

	The Mathematics Genealogy Project - Stephen Kleene
		Click here to see the students listed in chronological order.
		According to our current on-line database, Stephen Kleene has 13 students and 358 descendants.
		If you have additional information or corrections regarding this mathematician, please use the
	www.genealogy.ams.org /html/id.phtml?id=8012 (130 words)

	Learn more about Stephen Cole Kleene in the online encyclopedia. (Site not responding. Last check: 2007-10-19)
		Learn more about Stephen Cole Kleene in the online encyclopedia.
		Hint: Play with putting spaces before and after your words to see the different results you get.
		He was an instructor of navigation at the U.S. Naval Reserve's Midshipmen's School in New York, and then a project director at the Naval Research Laboratory in Washington, D.C
	www.onlineencyclopedia.org /s/st/stephen_cole_kleene.html (496 words)

	References for Kleene (Site not responding. Last check: 2007-10-19)
		A biographical sketch of Stephen C Kleene, The Kleene Symposium, Stud.
		Ph.D students of Stephen C Kleene, The Kleene Symposium, Stud.
		The bibliography of Stephen C Kleene, The Kleene Symposium, Stud.
	www-history.mcs.st-and.ac.uk /history/References/Kleene.html (89 words)

	STE from FOLDOC
		Previous: Stephen Cole Kleene, Stephen Jobs, Stephen Kleene, Stepstone Corp, stepwise refinement
		Previous: Stephen Jobs, Stephen Kleene, Stepstone Corp, stepwise refinement, stereogram
		Version 1.7 has been ported to Sequent, Sun, NeXT, Ultrix, BSDI and is available from comp.sources.unix volume 26.
	www.instantweb.com /d/dictionary/foldoc.cgi?query=STE (1117 words)

	Kleene from FOLDOC (Site not responding. Last check: 2007-10-19)
		Nearby terms: KL1 « Klamath « KLB « Kleene closure » Kleene star » Kleene, Stephen Cole » Klerer-May System
		(Or "Kleene closure", named after Stephen Kleene) The postfix "*" operator used in regular expressions, Extended Backus-Naur Form, and similar formalisms to specify a match for zero or more occurrences of the preceding expression.
		Nearby terms: KLB « Kleene closure « Kleene star « Kleene, Stephen Cole » Klerer-May System » KLOC » klone
	foldoc.org /?query=Kleene (112 words)

	stephen cole kleene - ResearchIndex document query (Site not responding. Last check: 2007-10-19)
		I begin with a brief review of intuitionism.
		Stephen Cole Kleene was the mathematician who saw most deeply
		logicians of the twentieth century, Stephen Cole Kleene, on January 26, 1994.
	citeseer.ist.psu.edu /cis?q=Stephen+Cole+Kleene (104 words)

	Find in a Library: The Kleene Symposium : proceedings of the symposium held June 18-24, 1978 at Madison, Wisconsin, ...
		Find in a Library: The Kleene Symposium : proceedings of the symposium held June 18-24, 1978 at Madison, Wisconsin, U.S.A. Search:
		The Kleene Symposium : proceedings of the symposium held June 18-24, 1978 at Madison, Wisconsin, U.S.A. by Stephen Cole Kleene; Jon Barwise; H Jerome Keisler; Kenneth Kunen
		WorldCat is provided by OCLC Online Computer Library Center, Inc. on behalf of its member libraries.
	www.worldcatlibraries.org /wcpa/ow/fce46a7f6f5cc59a.html (105 words)

	Annals of Pure and Applied Logic, Volume 81 (Site not responding. Last check: 2007-10-19)
		Special Volume Dedicated to the late Stephen Cole Kleene
		Anil Nerode, Gerald E. Sacks: Preface - Special Volume Dedicated to the late Stephen Cole Kleene.
		Mac Lane Saunders: Stephen Cole Kleene - a Reminiscence.
	www.vldb.org /dblp/db/journals/apal/apal81.html (131 words)

Try your search on: Qwika (all wikis)