default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth Kunen
Person information
- affiliation: University of Wisconsin, Madison, WI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j24]Kenneth Kunen:
Forcing and Differentiable Functions. Order 29(2): 293-310 (2012)- [j23]Kenneth Kunen, Jean A. Larson, Juris Steprans
:
Continuous Maps on Aronszajn Trees. Order 29(2): 311-316 (2012)
2000 – 2009
- 2009
- [j22]Kenneth Kunen, Dilip Raghavan:
Gregory trees, the continuum, and Martin's axiom. J. Symb. Log. 74(2): 712-720 (2009) - 2000
- [j21]Kenneth Kunen, Franklin D. Tall:
The Real Line in Elementary Submodels of Set Theory. J. Symb. Log. 65(2): 683-691 (2000)
1990 – 1999
- 1998
- [j20]Kenneth Kunen:
Nonconstructive Computational Mathematics. J. Autom. Reason. 21(1): 69-97 (1998) - 1996
- [j19]Kenneth Kunen:
The Semantics of Answer Literals. J. Autom. Reason. 17(1): 83-95 (1996) - 1995
- [j18]Joan Hart, Kenneth Kunen:
Single Axioms for Odd Exponent Groups. J. Autom. Reason. 14(3): 383-412 (1995) - [j17]Kenneth Kunen:
A Ramsey Theorem in Boyer-Moore Logic. J. Autom. Reason. 15(2): 217-235 (1995) - 1993
- [p1]Kenneth Kunen:
Declarative Semantics of Logic Programming. Current Trends in Theoretical Computer Science 1993: 354-376 - 1992
- [j16]Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
Polynomial-Time Compression. Comput. Complex. 2: 18-39 (1992) - [j15]Kenneth Kunen:
Single Axioms for Groups. J. Autom. Reason. 9(3): 291-308 (1992) - 1991
- [j14]Kenneth Kunen:
Declarative Semantics of Logic Programming. Bull. EATCS 44: 147-167 (1991) - [c3]Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223
1980 – 1989
- 1989
- [j13]Kenneth Kunen:
Signed Data Dependencies in Logic Programs. J. Log. Program. 7(3): 231-245 (1989) - [j12]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
- [j11]Kenneth Kunen:
Where Ma First Fails. J. Symb. Log. 53(2): 429-433 (1988) - [c2]Kenneth Kunen:
Some Remarks on the Completed Database. ICLP/SLP 1988: 978-992 - 1987
- [j10]Kenneth Kunen:
Negation in Logic Programming. J. Log. Program. 4(4): 289-308 (1987) - [c1]Kenneth Kunen:
Answer Sets and Negation-as-Failure. ICLP 1987: 219-228 - 1985
- [j9]W. W. Bledsoe, Kenneth Kunen, Robert E. Shostak:
Completeness Results for Inequality Provers. Artif. Intell. 27(3): 255-288 (1985) - 1984
- [j8]Tim Carlson, Kenneth Kunen, Arnold W. Miller:
A Minimal Degree Which Collapses omega1. J. Symb. Log. 49(1): 298-300 (1984) - 1983
- [b1]Kenneth Kunen:
Set theory - an introduction to independence proofs. Studies in logic and the foundations of mathematics 102, North-Holland 1983, ISBN 978-0-444-86839-8, pp. I-XVI, 1-313 - [j7]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)
1970 – 1979
- 1979
- [j6]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
- [j5]Kenneth Kunen:
Saturated Ideals. J. Symb. Log. 43(1): 65-76 (1978) - [j4]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
- [j3]Kenneth Kunen:
Elementary Embeddings and Infinitary Combinatorics. J. Symb. Log. 36(3): 407-413 (1971) - [j2]Kenneth Kunen, Karel Prikry:
On Descendingly Incomplete Ultrafilters. J. Symb. Log. 36(4): 650-652 (1971)
1960 – 1969
- 1968
- [j1]Kenneth Kunen:
Implicit Definability and Infinitary Languages. J. Symb. Log. 33(3): 446-451 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
