2000 |
24 | | Kenneth Kunen,
Franklin D. Tall:
The Real Line in Elementary Submodels of Set Theory.
J. Symb. Log. 65(2): 683-691 (2000) |
1998 |
23 | | Kenneth Kunen:
Nonconstructive Computational Mathematics.
J. Autom. Reasoning 21(1): 69-97 (1998) |
1996 |
22 | | Kenneth Kunen:
The Semantics of Answer Literals.
J. Autom. Reasoning 17(1): 83-95 (1996) |
1995 |
21 | | Joan Hart,
Kenneth Kunen:
Single Axioms for Odd Exponent Groups.
J. Autom. Reasoning 14(3): 383-412 (1995) |
20 | | Kenneth Kunen:
A Ramsey Theorem in Boyer-Moore Logic.
J. Autom. Reasoning 15(2): 217-235 (1995) |
1992 |
19 | | Judy Goldsmith,
Lane A. Hemachandra,
Kenneth Kunen:
Polynomial-Time Compression.
Computational Complexity 2: 18-39 (1992) |
18 | | Kenneth Kunen:
Single Axioms for Groups.
J. Autom. Reasoning 9(3): 291-308 (1992) |
1991 |
17 | | Judy Goldsmith,
Lane A. Hemachandra,
Kenneth Kunen:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.
FSTTCS 1991: 212-223 |
16 | | Kenneth Kunen:
Declarative Semantics of Logic Programming.
Bulletin of the EATCS 44: 147-167 (1991) |
1989 |
15 | | Kenneth Kunen:
Signed Data Dependencies in Logic Programs.
J. Log. Program. 7(3): 231-245 (1989) |
14 | | H. Jerome Keisler,
Kenneth Kunen,
Arnold W. Miller,
Steven C. Leth:
Descriptive Set Theory Over Hyperfinite Sets.
J. Symb. Log. 54(4): 1167-1180 (1989) |
1988 |
13 | | Kenneth Kunen:
Some Remarks on the Completed Database.
ICLP/SLP 1988: 978-992 |
12 | | Kenneth Kunen:
Where Ma First Fails.
J. Symb. Log. 53(2): 429-433 (1988) |
1987 |
11 | | Kenneth Kunen:
Answer Sets and Negation-as-Failure.
ICLP 1987: 219-228 |
10 | | Kenneth Kunen:
Negation in Logic Programming.
J. Log. Program. 4(4): 289-308 (1987) |
1985 |
9 | | W. W. Bledsoe,
Kenneth Kunen,
Robert E. Shostak:
Completeness Results for Inequality Provers.
Artif. Intell. 27(3): 255-288 (1985) |
1984 |
8 | | Tim Carlson,
Kenneth Kunen,
Arnold W. Miller:
A Minimal Degree Which Collapses omega1.
J. Symb. Log. 49(1): 298-300 (1984) |
1983 |
7 | | Kenneth Kunen,
Donald H. Pelletier:
On a Combinatorial Property of Menas Related to the Partition Property for Measures on Supercompact Cardinals.
J. Symb. Log. 48(2): 475-481 (1983) |
1979 |
6 | | John Addison,
Jon Barwise,
H. Jerome Keisler,
Kenneth Kunen,
Yiannis N. Moschovakis:
The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic.
J. Symb. Log. 44(3): 469-480 (1979) |
1978 |
5 | | Kenneth Kunen:
Saturated Ideals.
J. Symb. Log. 43(1): 65-76 (1978) |
4 | | Jon Barwise,
Kenneth Kunen,
Joseph S. Ullian:
Annual Meeting of the Association for Symbolic Logic: Saint Louis, 1977.
J. Symb. Log. 43(2): 365-372 (1978) |
1971 |
3 | | Kenneth Kunen:
Elementary Embeddings and Infinitary Combinatorics.
J. Symb. Log. 36(3): 407-413 (1971) |
2 | | Kenneth Kunen,
Karel Prikry:
On Descendingly Incomplete Ultrafilters.
J. Symb. Log. 36(4): 650-652 (1971) |
1968 |
1 | | Kenneth Kunen:
Implicit Definability and Infinitary Languages.
J. Symb. Log. 33(3): 446-451 (1968) |