Kunen, Kenneth
Overview
Works:  26 works in 131 publications in 3 languages and 1,701 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Honoree 
Classifications:  QA9, 511.3 
Publication Timeline
.
Most widely held works by
Kenneth Kunen
Set theory : an introduction to independence proofs by
Kenneth Kunen(
Book
)
45 editions published between 1980 and 2006 in English and Undetermined and held by 567 WorldCat member libraries worldwide
Provability, Computability and Reflection
45 editions published between 1980 and 2006 in English and Undetermined and held by 567 WorldCat member libraries worldwide
Provability, Computability and Reflection
Handbook of settheoretic topology by K Kunen(
Book
)
17 editions published between 1983 and 1991 in English and held by 384 WorldCat member libraries worldwide
This Handbook is an introduction to settheoretic topology for students in the field and for researchers in other areas for whom results in settheoretic topology may be relevant. The aim of the editors has been to make it as selfcontained as possible without repeating material which can easily be found in standard texts. The Handbook contains detailed proofs of core results, and references to the literature for peripheral results where space was insufficient. Included are many open problems of current interest.In general, the articles may be read in any order. In a few cases they occur in pairs, with the first one giving an elementary treatment of a subject and the second one more advanced results. These pairs are: Hodel and Juhász on cardinal functions; Roitman and AbrahamTodorčević on S and Lspaces; Weiss and Baumgartner on versions of Martin's axiom; and Vaughan and Stephenson on compactness properties
17 editions published between 1983 and 1991 in English and held by 384 WorldCat member libraries worldwide
This Handbook is an introduction to settheoretic topology for students in the field and for researchers in other areas for whom results in settheoretic topology may be relevant. The aim of the editors has been to make it as selfcontained as possible without repeating material which can easily be found in standard texts. The Handbook contains detailed proofs of core results, and references to the literature for peripheral results where space was insufficient. Included are many open problems of current interest.In general, the articles may be read in any order. In a few cases they occur in pairs, with the first one giving an elementary treatment of a subject and the second one more advanced results. These pairs are: Hodel and Juhász on cardinal functions; Roitman and AbrahamTodorčević on S and Lspaces; Weiss and Baumgartner on versions of Martin's axiom; and Vaughan and Stephenson on compactness properties
The Kleene Symposium : proceedings of the symposium held June 1824, 1978 at Madison, Wisconsin, U.S.A. by
Kleene Symposium(
Book
)
16 editions published in 1980 in English and Undetermined and held by 306 WorldCat member libraries worldwide
16 editions published in 1980 in English and Undetermined and held by 306 WorldCat member libraries worldwide
The foundations of mathematics by
Kenneth Kunen(
Book
)
11 editions published between 2009 and 2012 in English and held by 70 WorldCat member libraries worldwide
11 editions published between 2009 and 2012 in English and held by 70 WorldCat member libraries worldwide
Set theory by
Kenneth Kunen(
Book
)
11 editions published between 2011 and 2013 in English and held by 41 WorldCat member libraries worldwide
11 editions published between 2011 and 2013 in English and held by 41 WorldCat member libraries worldwide
Handbook of mathematical logic by
Jon Barwise(
Book
)
3 editions published between 1977 and 1983 in English and Italian and held by 12 WorldCat member libraries worldwide
The handbook is divided into four parts: model theory, set theory, recursion theory and proof theory. Each of the four parts begins with a short guide to the chapters that follow. Each chapter is written for nonspecialists in the field in question. Mathematicians will find that this book provides them with a unique opportunity to apprise themselves of developments in areas other than their own
3 editions published between 1977 and 1983 in English and Italian and held by 12 WorldCat member libraries worldwide
The handbook is divided into four parts: model theory, set theory, recursion theory and proof theory. Each of the four parts begins with a short guide to the chapters that follow. Each chapter is written for nonspecialists in the field in question. Mathematicians will find that this book provides them with a unique opportunity to apprise themselves of developments in areas other than their own
Inaccessibility properties of cardinals by
Kenneth Kunen(
Book
)
5 editions published in 1968 in English and held by 9 WorldCat member libraries worldwide
5 editions published in 1968 in English and held by 9 WorldCat member libraries worldwide
On the structure and complexity of infinite sets with minimal perfect hash functions by
Judith Goldsmith(
Book
)
1 edition published in 1990 in English and held by 6 WorldCat member libraries worldwide
On the other hand, we present evidence that some infinite NP sets, and indeed some infinite P sets, do not have polynomialtime computable minimal perfect hash functions: if an infinite NP set A has polynomialtime computable perfect minimal hash functions, then A has an infinite sparse NP subset, yet we construct a relativized world in which some infinite NP sets lack infinite sparse NP subsets. This world is built upon a result that is of interest in its own right; we determine optimally  with respect to any relativizable proof technique  the complexity of the easiest infinite sparse subsets that infinite P sets are guaranteed to have."
1 edition published in 1990 in English and held by 6 WorldCat member libraries worldwide
On the other hand, we present evidence that some infinite NP sets, and indeed some infinite P sets, do not have polynomialtime computable minimal perfect hash functions: if an infinite NP set A has polynomialtime computable perfect minimal hash functions, then A has an infinite sparse NP subset, yet we construct a relativized world in which some infinite NP sets lack infinite sparse NP subsets. This world is built upon a result that is of interest in its own right; we determine optimally  with respect to any relativizable proof technique  the complexity of the easiest infinite sparse subsets that infinite P sets are guaranteed to have."
Logic for logic programmers by
Kenneth Kunen(
Book
)
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The goal of logic programming is that the program, or database, can be understood by logic alone, independently of any execution model. Attempts to realize this goal have made it clear that the logic involved must go beyond ordinary firstorder logic. This survey will explore several topics of current interest in the logical meaning of logic programs, with particular attention paid to: (1) The meaning of negation; this still remains problematical, although many partial results are known. (2) The meaning of recursions; these imply a least fixedpoint computation in deductive databases, and something else in Prolog. (3) The meaning of the Prolog builtin [sic] predicates, such as the evaluation of numeric terms. (4) The semantic meaning of the order in which a stream of answers is returned."
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The goal of logic programming is that the program, or database, can be understood by logic alone, independently of any execution model. Attempts to realize this goal have made it clear that the logic involved must go beyond ordinary firstorder logic. This survey will explore several topics of current interest in the logical meaning of logic programs, with particular attention paid to: (1) The meaning of negation; this still remains problematical, although many partial results are known. (2) The meaning of recursions; these imply a least fixedpoint computation in deductive databases, and something else in Prolog. (3) The meaning of the Prolog builtin [sic] predicates, such as the evaluation of numeric terms. (4) The semantic meaning of the order in which a stream of answers is returned."
A completeness result for linked resolution by
Kenneth Kunen(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
In this paper, we prove the completeness of a version of linked resolution which limits the manner in which clauses may be used as linking clauses; the completeness of hyperresolution is a special case of this."
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
In this paper, we prove the completeness of a version of linked resolution which limits the manner in which clauses may be used as linking clauses; the completeness of hyperresolution is a special case of this."
Nonconstructive computational mathematics by
Kenneth Kunen(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We describe a nonconstructive extension to Primitive Recursive Arithmetic, both abstractly, and as implemented on the Boyer Moore prover. Abstractly, this extension is obtained by adding the unbounded [mu] operator applied to primitive recursive functions; doing so, one can define the Ackermann function and prove the consistency of Primitive Recursive Arithmetic. The implementation does not mention the [mu] operator explicitly, but has the strength to define the [mu] operator through the builtin functions EVAL$ and V & C$."
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We describe a nonconstructive extension to Primitive Recursive Arithmetic, both abstractly, and as implemented on the Boyer Moore prover. Abstractly, this extension is obtained by adding the unbounded [mu] operator applied to primitive recursive functions; doing so, one can define the Ackermann function and prove the consistency of Primitive Recursive Arithmetic. The implementation does not mention the [mu] operator explicitly, but has the strength to define the [mu] operator through the builtin functions EVAL$ and V & C$."
The shortest single axioms for groups of exponent 4 by
Kenneth Kunen(
Book
)
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
The semantics of answer literals by
Kenneth Kunen(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We describe a semantics for answer literals which is not tied to the specific details of the resolution proof procedure. We also describe a number of applications of answer literals to mathematical theorem proving."
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We describe a semantics for answer literals which is not tied to the specific details of the resolution proof procedure. We also describe a number of applications of answer literals to mathematical theorem proving."
Single axioms for groups by
Kenneth Kunen(
Book
)
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We study equations of the form ([alpha]=x) which are single axioms for group theory. Earlier examples of such were found by Neumann and McCune. We prove some lower bounds on the complexity of such [alpha], showing that McCune's examples are the shortest possible. We also show that no such [alpha] can have only two distinct variables. We do produce an [alpha] with only three distinct variables, refuting a conjecture of Neumann. Automated reasoning techniques are used both positively (searching for and verifying single axioms) and negatively (proving that various candidate ([alpha]=x) hold in some nongroup and are hence not single axioms)."
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We study equations of the form ([alpha]=x) which are single axioms for group theory. Earlier examples of such were found by Neumann and McCune. We prove some lower bounds on the complexity of such [alpha], showing that McCune's examples are the shortest possible. We also show that no such [alpha] can have only two distinct variables. We do produce an [alpha] with only three distinct variables, refuting a conjecture of Neumann. Automated reasoning techniques are used both positively (searching for and verifying single axioms) and negatively (proving that various candidate ([alpha]=x) hold in some nongroup and are hence not single axioms)."
Signed data dependencies in logic programs by
Kenneth Kunen(
Book
)
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
Measures on Corson compact spaces by
Kenneth Kunen(
Book
)
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
Shūgōron : Dokuritsusei shōmei eno annai(
Book
)
2 editions published in 2008 in Japanese and held by 2 WorldCat member libraries worldwide
2 editions published in 2008 in Japanese and held by 2 WorldCat member libraries worldwide
Single axioms for odd exponent groups by J Hart(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "With the aid of automated reasoning techniques, we show that all previously known short single axioms for odd exponent groups are special cases of one general schema. We also demonstrate how to convert the proofs generated by an automated reasoning system into proofs understandable by a human."
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "With the aid of automated reasoning techniques, we show that all previously known short single axioms for odd exponent groups are special cases of one general schema. We also demonstrate how to convert the proofs generated by an automated reasoning system into proofs understandable by a human."
A completeness theorem for multiple chaining by
Kenneth Kunen(
Book
)
1 edition published in 1980 in English and held by 1 WorldCat member library worldwide
1 edition published in 1980 in English and held by 1 WorldCat member library worldwide
Proceedings by Kleene Symposium(
Book
)
1 edition published in 1980 in English and held by 1 WorldCat member library worldwide
1 edition published in 1980 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Keisler, H. Jerome Editor
 Barwise, Jon Editor
 Vaughan, Jerry E. Other Editor
 Kleene, Stephen Cole 19091994 Honoree
 Troelstra, A. S.
 Moschovakis, Yiannis N.
 Hemachandra, Lane A.
 Goldsmith, Judy Author
 Mill, Jan van
 Hart, Joan Author
Useful Links
Associated Subjects
Automatic theorem proving Axiomatic set theory Cardinal numbers Completeness theorem Computational complexity Grammar, Comparative and generalSentences Group theory Intuitionistic mathematics Kleene, Stephen Cole, Logic, Symbolic and mathematical Logic programming Model theory NPcomplete problems Recursion theory Recursive functions Semantics Set theory Topology
Alternative Names
Kenneth Kunen Amerikaans wiskundige
Kenneth Kunen amerikansk matematikar
Kenneth Kunen amerikansk matematiker
Kenneth Kunen USamerikanischer Mathematiker, Professor für Mathematik
Kunen, Herbert Kenneth 1943
Kunen, Ken 1943
Kunen, Kenneth
キューネン, ケネス
ケネス・キューネン
肯尼思·丘嫩
Languages
Covers