default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Cowen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j16]Robert Cowen:
A Beginner's Guide to Mathematical Logic. Am. Math. Mon. 125(2): 188-192 (2018)- 2015
- [j15]Robert Cowen:
Deleting Edges from Ramsey Minimal Examples. Am. Math. Mon. 122(7): 681-683 (2015) - 2010
- [j14]Robert Cowen:
Generalized Davis-Putnam and satisfiability problems in mathematics. Log. J. IGPL 18(3): 456-463 (2010) - 2009
- [j13]Robert Cowen:
2-CNFS and Logical Embeddings. Stud Logica 93(1): 15-19 (2009) - 2008
- [j12]Lenore J. Cowen, Robert Cowen, Arthur Steinberg:
Totally Greedy Coin Sets and Greedy Obstructions. Electron. J. Comb. 15(1) (2008) - 2007
- [j11]Robert Cowen, Stephen H. Hechler, John W. Kennedy, Arthur Steinberg:
Odd neighborhood transversals on grid graphs. Discret. Math. 307(17-18): 2200-2208 (2007) - [j10]Robert Cowen, Adam Kolany:
Davis-Putnam Style Rules for Deciding Property S. Fundam. Informaticae 79(1-2): 5-15 (2007) - 2001
- [j9]Robert Cowen:
Property S. Reports Math. Log. 35: 61-74 (2001) - 1998
- [j8]Robert Cowen:
A Compactness Theorem for Infinite Constraint Satisfaction. Reports Math. Log. 32: 97-107 (1998) - 1996
- [j7]Robert Cowen, William Emerson:
A compactness theorem for linear equations. Stud Logica 57(2/3): 355-357 (1996) - 1993
- [j6]Robert Cowen, Katherine Wyatt:
BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas. Notre Dame J. Formal Log. 34(4): 602-606 (1993) - [j5]Robert Cowen:
Combinatorial Analytic Tableaux. Reports Math. Log. 27: 29-39 (1993) - 1991
- [j4]Robert Cowen:
Hypergraph Satisfiability. Reports Math. Log. 25 (1991) - 1990
- [j3]Robert Cowen:
Two Hypergraph Theorems Equivalent to BPI. Notre Dame J. Formal Log. 31(2): 232-240 (1990) - 1986
- [j2]Lenore J. Cowen, Robert Cowen, Douglas R. Woodall:
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. J. Graph Theory 10(2): 187-195 (1986) - 1983
- [j1]Robert Cowen:
Compactness via prime semilattices. Notre Dame J. Formal Log. 24(2): 199-204 (1983)
Conference and Workshop Papers
- 1993
- [c1]Robert Cowen:
Some Connections Between Set Theory and Computer Science. Kurt Gödel Colloquium 1993: 14-22
Informal and Other Publications
- 2014
- [i2]Robert Cowen:
Adaptive Fault Diagnosis using Self-Referential Reasoning. CoRR abs/1407.6255 (2014) - 2012
- [i1]Robert Cowen:
A Method for Constructing Minimally Unsatisfiable CNFs. CoRR abs/1211.7152 (2012)
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:05 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:
