Dolph E. Ulrich

Dolph E. Ulrich

Professor // Philosophy
Emeriti Faculty

Curriculum vitae

Office and Contact

PhD, Wayne State University




Logic, Metalogic

Selected Publications


D-complete axioms for the classical equivalential calculus,” Bulletin of the Section of Logic(University of Lódz) 31 (2005): 135-142.“XCB, the last of the shortest single axioms for the equivalential calculus” (with Larry Wos and Branden Fitelson), Bulletin of the Section of Logic(University of Lódz) 29 (2003): 131-136.“A legacy recalled and a tradition continued,” Journal of Automated Reasoning 27 (2001): 97-122.“The shortest possible length of the longest implicational axiom,” Journal of Philosoph­ical Logic 25 (1996): 101-108.“On the characterization of sentential calculi by finite matrices,” Reports on Mathe­ma­tical Logic 20 (1986): 63-86.“A descending chain of incomplete extensions of implicational S5,” Zeitschrift für mathema­tische Logik und Grundlagen der Mathematik 31 (1985): 201-208.“The finite model property and recursive bounds on the size of countermodels,” Journal of  Philosophical Logic 12 (1983): 477-480.“Strict implication in a sequence of extensions of S4,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik 27 (1981): 201-212.

"Some results concerning finite models for sentential calculi," Notre Dame Journal of Formal Logic 13 (1972): 363-368.

Text book

Elementary Symbolic Logic (with William Gustason), 2nd ed. Waveland Press: Prospect Heights, 1989.

Work in Progress

Several articles on new single axioms for various sentential calculi.
An article introducing the new two-base {Cpp, CCCpqrCCCqstCCtqr} for classical implication to answer an open question first posed by Prior half a century ago.


Purdue University, West Lafayette, IN 47907 (765) 494-4600

© 2020 Purdue University | An equal access/equal opportunity university | Copyright Complaints | Maintained by CLA

If you have trouble accessing this page because of a disability, please contact the College of Liberal Arts Webmaster.

Some content on this site may require the use of a special plug-in or application. Please visit our plug-ins page for links to download these applications.