We stand with Ukraine  

Kenneth Kunen

Affiliations:
  • University of Wisconsin, Madison, WI, USA


According to our database1, Kenneth Kunen authored at least 29 papers between 1968 and 2012.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Continuous Maps on Aronszajn Trees.
[BibTeX]
[DOI]
Kenneth Kunen
,
Jean A. Larson
,
Juris Steprans
Order, 2012

Forcing and Differentiable Functions.
[BibTeX]
[DOI]
Kenneth Kunen
Order, 2012

2009
Gregory trees, the continuum, and Martin's axiom.
[BibTeX]
[DOI]
Kenneth Kunen
,
Dilip Raghavan
J. Symb. Log., 2009

2000
The Real Line in Elementary Submodels of Set Theory.
[BibTeX]
[DOI]
Kenneth Kunen
,
Franklin D. Tall
J. Symb. Log., 2000

1998
Nonconstructive Computational Mathematics.
[BibTeX]
[DOI]
Kenneth Kunen
J. Autom. Reason., 1998

1996
The Semantics of Answer Literals.
[BibTeX]
[DOI]
Kenneth Kunen
J. Autom. Reason., 1996

1995
A Ramsey Theorem in Boyer-Moore Logic.
[BibTeX]
[DOI]
Kenneth Kunen
J. Autom. Reason., 1995

Single Axioms for Odd Exponent Groups.
[BibTeX]
[DOI]
Joan Hart
,
Kenneth Kunen
J. Autom. Reason., 1995

1993
Declarative Semantics of Logic Programming.
[BibTeX]
[DOI]
Kenneth Kunen
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

1992
Single Axioms for Groups.
[BibTeX]
[DOI]
Kenneth Kunen
J. Autom. Reason., 1992

Polynomial-Time Compression.
[BibTeX]
[DOI]
Judy Goldsmith
,
Lane A. Hemachandra
,
Kenneth Kunen
Comput. Complex., 1992

1991
Declarative Semantics of Logic Programming.
[BibTeX]
Kenneth Kunen
Bull. EATCS, 1991

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.
[BibTeX]
[DOI]
Judy Goldsmith
,
Lane A. Hemachandra
,
Kenneth Kunen
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1989
Descriptive Set Theory Over Hyperfinite Sets.
[BibTeX]
[DOI]
H. Jerome Keisler
,
Kenneth Kunen
,
Arnold W. Miller
,
Steven C. Leth
J. Symb. Log., 1989

Signed Data Dependencies in Logic Programs.
[BibTeX]
[DOI]
Kenneth Kunen
J. Log. Program., 1989

1988
Where Ma First Fails.
[BibTeX]
[DOI]
Kenneth Kunen
J. Symb. Log., 1988

Some Remarks on the Completed Database.
[BibTeX]
Kenneth Kunen
Proceedings of the Logic Programming, 1988

1987
Negation in Logic Programming.
[BibTeX]
[DOI]
Kenneth Kunen
J. Log. Program., 1987

Answer Sets and Negation-as-Failure.
[BibTeX]
Kenneth Kunen
Proceedings of the Logic Programming, 1987

1985
Completeness Results for Inequality Provers.
[BibTeX]
[DOI]
W. W. Bledsoe
,
Kenneth Kunen
,
Robert E. Shostak
Artif. Intell., 1985

1984
A Minimal Degree Which Collapses omega<sub>1</sub>.
[BibTeX]
[DOI]
Tim Carlson
,
Kenneth Kunen
,
Arnold W. Miller
J. Symb. Log., 1984

1983
On a Combinatorial Property of Menas Related to the Partition Property for Measures on Supercompact Cardinals.
[BibTeX]
[DOI]
Kenneth Kunen
,
Donald H. Pelletier
J. Symb. Log., 1983

Set theory - an introduction to independence proofs.
[BibTeX]
Kenneth Kunen
Studies in logic and the foundations of mathematics 102, North-Holland, ISBN: 978-0-444-86839-8, 1983

1979
The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic.
[BibTeX]
[DOI]
John Addison
,
Jon Barwise
,
H. Jerome Keisler
,
Kenneth Kunen
,
Yiannis N. Moschovakis
J. Symb. Log., 1979

1978
Saturated Ideals.
[BibTeX]
[DOI]
Kenneth Kunen
J. Symb. Log., 1978

Annual Meeting of the Association for Symbolic Logic: Saint Louis, 1977.
[BibTeX]
[DOI]
Jon Barwise
,
Kenneth Kunen
,
Joseph S. Ullian
J. Symb. Log., 1978

1971
On Descendingly Incomplete Ultrafilters.
[BibTeX]
[DOI]
Kenneth Kunen
,
Karel Prikry
J. Symb. Log., 1971

Elementary Embeddings and Infinitary Combinatorics.
[BibTeX]
[DOI]
Kenneth Kunen
J. Symb. Log., 1971

1968
Implicit Definability and Infinitary Languages.
[BibTeX]
[DOI]
Kenneth Kunen
J. Symb. Log., 1968


  Loading...