Compactness via prime semilattices. - Robert Cowen (Notre Dame J. Formal Log., 1983)

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. - Lenore J. Cowen; Robert Cowen; Douglas R. Woodall (J. Graph Theory, 1986)

Two Hypergraph Theorems Equivalent to BPI. - Robert Cowen (Notre Dame J. Formal Log., 1990)

Hypergraph Satisfiability. - Robert Cowen (Reports Math. Log., 1991)

Some Connections Between Set Theory and Computer Science. - Robert Cowen (Kurt Gödel Colloquium, 1993)

BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas. - Robert Cowen; Katherine Wyatt (Notre Dame J. Formal Log., 1993)

Combinatorial Analytic Tableaux. - Robert Cowen (Reports Math. Log., 1993)

A compactness theorem for linear equations. - Robert Cowen; William Emerson (Stud Logica, 1996)

A Compactness Theorem for Infinite Constraint Satisfaction. - Robert Cowen (Reports Math. Log., 1998)

Property S. - Robert Cowen (Reports Math. Log., 2001)

Odd neighborhood transversals on grid graphs. - Robert Cowen; Stephen H. Hechler; John W. Kennedy; Arthur Steinberg (Discret. Math., 2007)

Davis-Putnam Style Rules for Deciding Property S. - Robert Cowen; Adam Kolany (Fundam. Informaticae, 2007)

Totally Greedy Coin Sets and Greedy Obstructions. - Lenore J. Cowen; Robert Cowen; Arthur Steinberg (Electron. J. Comb., 2008)

2-CNFS and Logical Embeddings. - Robert Cowen (Stud Logica, 2009)

Generalized Davis-Putnam and satisfiability problems in mathematics. - Robert Cowen (Log. J. IGPL, 2010)

A Method for Constructing Minimally Unsatisfiable CNFs. - Robert Cowen (CoRR, 2012)

Adaptive Fault Diagnosis using Self-Referential Reasoning. - Robert Cowen (CoRR, 2014)

Deleting Edges from Ramsey Minimal Examples. - Robert Cowen (Am. Math. Mon., 2015)

A Beginner's Guide to Mathematical Logic. - Robert Cowen (Am. Math. Mon., 2018)