Kenneth Kunen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2012

Forcing and Differentiable FunctionsKenneth Kunen. order, 29(2):293-310, 2012. [doi]

Continuous Maps on Aronszajn TreesKenneth Kunen, Jean A. Larson, Juris Steprans. order, 29(2):311-316, 2012. [doi]

2009

Gregory trees, the continuum, and Martin s axiomKenneth Kunen, Dilip Raghavan. JSYML, 74(2):712-720, 2009. [doi]

2000

The Real Line in Elementary Submodels of Set TheoryKenneth Kunen, Franklin D. Tall. JSYML, 65(2):683-691, 2000.

1998

Nonconstructive Computational MathematicsKenneth Kunen. JAR, 21(1):69-97, 1998.

1996

The Semantics of Answer LiteralsKenneth Kunen. JAR, 17(1):83-95, 1996.

1995

Single Axioms for Odd Exponent GroupsJoan Hart, Kenneth Kunen. JAR, 14(3):383-412, 1995.

A Ramsey Theorem in Boyer-Moore LogicKenneth Kunen. JAR, 15(2):217-235, 1995.

1993

Declarative Semantics of Logic ProgrammingKenneth Kunen. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 354-376, World Scientific, 1993. [doi]

1992

Polynomial-Time CompressionJudy Goldsmith, Lane A. Hemachandra, Kenneth Kunen. cc, 2:18-39, 1992.

Single Axioms for GroupsKenneth Kunen. JAR, 9(3):291-308, 1992.

1991

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash FunctionsJudy Goldsmith, Lane A. Hemachandra, Kenneth Kunen. fsttcs 1991: 212-223

Declarative Semantics of Logic ProgrammingKenneth Kunen. eatcs, 44:147-167, 1991.

1989

Descriptive Set Theory Over Hyperfinite SetsH. Jerome Keisler, Kenneth Kunen, Arnold W. Miller, Steven C. Leth. JSYML, 54(4):1167-1180, 1989.

Signed Data Dependencies in Logic ProgramsKenneth Kunen. jlp, 7(3):231-245, 1989.

1988

Some Remarks on the Completed DatabaseKenneth Kunen. ICLP 1988: 978-992

Where Ma First FailsKenneth Kunen. JSYML, 53(2):429-433, 1988.

1987

Answer Sets and Negation-as-FailureKenneth Kunen. ICLP 1987: 219-228

Negation in Logic ProgrammingKenneth Kunen. jlp, 4(4):289-308, 1987.

1985

Completeness Results for Inequality ProversW. W. Bledsoe, Kenneth Kunen, Robert E. Shostak. ai, 27(3):255-288, 1985.

1984

A Minimal Degree Which Collapses omega::1::Tim Carlson, Kenneth Kunen, Arnold W. Miller. JSYML, 49(1):298-300, 1984.

1983

On a Combinatorial Property of Menas Related to the Partition Property for Measures on Supercompact CardinalsKenneth Kunen, Donald H. Pelletier. JSYML, 48(2):475-481, 1983.

Set theory - an introduction to independence proofsKenneth Kunen. Volume 102 of Studies in logic and the foundations of mathematics, North-Holland, 1983.

1979

The Kleene Symposium and the Summer Meeting of the Association for Symbolic LogicJohn Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen, Yiannis N. Moschovakis. JSYML, 44(3):469-480, 1979.

1978

Annual Meeting of the Association for Symbolic Logic: Saint Louis, 1977Jon Barwise, Kenneth Kunen, Joseph S. Ullian. JSYML, 43(2):365-372, 1978.

Saturated IdealsKenneth Kunen. JSYML, 43(1):65-76, 1978.

1971

On Descendingly Incomplete UltrafiltersKenneth Kunen, Karel Prikry. JSYML, 36(4):650-652, 1971.

Elementary Embeddings and Infinitary CombinatoricsKenneth Kunen. JSYML, 36(3):407-413, 1971.

1968

Implicit Definability and Infinitary LanguagesKenneth Kunen. JSYML, 33(3):446-451, 1968.

Sign in or sign up to see more results.

runs on WebDSL

翻译：