- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by R. Cowen
14 found
Order:
Disambiguations
Disambiguations:
| Robert Cowen [11] | Robert H. Cowen [6] | R. H. Cowen [3] | Roy C. Cowen [1] |
| R. Cowen [1] |
- Two hypergraph theorems equivalent to ${\rm BPI}$.Robert H. Cowen - 1990 - Notre Dame Journal of Formal Logic 31 (2):232-240.
- Generalizing König's infinity lemma.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):243-247.
- 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.
- Autonomy, citizenship, themarketand education.Robert Cowen - 1997 - In David Bridges (ed.), Education, autonomy, and democratic citizenship: philosophy in a changing world. New York: Routledge. pp. 2--61.
- 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
- 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.
- (1 other version)Elementary Equivalence and Constructible Models of Zermelo‐Fraenkel Set Theory.R. H. Cowen - 1976 - Mathematical Logic Quarterly 22 (1):333-338.
- The evaluation of higher education systems.Robert Cowen - 1997 - British Journal of Educational Studies 45 (2):213-213.Export citation
Bookmark - Compactness via prime semilattices.R. H. Cowen - 1983 - Notre Dame Journal of Formal Logic 24 (2):199-204.
- A characterization of logical consequence in quantification theory.Robert H. Cowen - 1975 - Notre Dame Journal of Formal Logic 16 (3):375-377.
- A new proof of the compactness theorem for propositional logic.Robert H. Cowen - 1970 - Notre Dame Journal of Formal Logic 11 (1):79-80.
- 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.
- Binary consistent choice on triples.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):310-312.
- Superinductive classes in class-set theory.Robert H. Cowen - 1971 - Notre Dame Journal of Formal Logic 12 (1):62-68.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-wmc4m dc2