13 found
Order:
Disambiguations
Robert Cowen [11]Robert H. Cowen [7]
  1.  6
    Two Hypergraph Theorems Equivalent to ${\rm BPI}$.Robert H. Cowen - 1990 - Notre Dame Journal of Formal Logic 31 (2):232-240.
  2. The Evaluation of Higher Education Systems.Robert Cowen - 1997 - British Journal of Educational Studies 45 (2):213-213.
     
    Export citation  
     
    Bookmark  
  3.  12
    Generalizing König's Infinity Lemma.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):243-247.
  4.  30
    2-CNFS and Logical Embeddings.Robert Cowen - 2009 - Studia Logica 93 (1):15-19.
    The expressive power of 2-cnfs, conjunctive normal forms with two literals per clause, is shown to be severely limited compared to 3-cnfs.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  5.  7
    Two Hypergrαph Theorems Equivalent toBPI.Robert H. Cowen - 1990 - Notre Dame Journal of Formal Logic 31 (2):232-240.
  6.  21
    Book Reviews Section 2.Robert Cowen, Sean D. Healy, Edgar B. Gumbert, Geoffrey M. Ibim, Fannie R. Cooley, Stuart J. Cohen, Maurice F. Freehill, Evan R. Powell, Virginia K. Wiegand, Geraldine Johncich Clifford, Charles E. Mcclelland, George C. Stone, Glenn C. Atkyns, Barbara Finkelstein, Gene P. Agre, Alton Harrison Jr & William G. Williams - 1973 - Educational Studies 4 (4):210-221.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  9
    Binary Consistent Choice on Triples.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):310-312.
  8.  4
    A Characterization of Logical Consequence in Quantification Theory.Robert H. Cowen - 1975 - Notre Dame Journal of Formal Logic 16 (3):375-377.
  9.  22
    A New Proof of the Compactness Theorem for Propositional Logic.Robert H. Cowen - 1970 - Notre Dame Journal of Formal Logic 11 (1):79-80.
  10.  18
    A Compactness Theorem for Linear Equations.Robert Cowen & William Emerson - 1996 - Studia Logica 57 (2-3):355 - 357.
    It is proved that a system of linear equations over an arbitrary field has a solution if every finite subsystem has a solution provided that the set of variables can be well ordered.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  10
    BREAKUP: A Preprocessing Algorithm for Satisfiability Testing of CNF Formulas.Robert Cowen & Katherine Wyatt - 1993 - Notre Dame Journal of Formal Logic 34 (4):602-606.
  12.  12
    Superinductive Classes in Class-Set Theory.Robert H. Cowen - 1971 - Notre Dame Journal of Formal Logic 12 (1):62-68.
  13.  2
    Autonomy, Citizenship, Themarketand Education.Robert Cowen - 1997 - In David Bridges (ed.), Education, Autonomy, and Democratic Citizenship: Philosophy in a Changing World. Routledge. pp. 2--61.