• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 58 matches

• 1971
• 
  Robert John Ackermann:
  Matrix satisfiability and axiomatization. Notre Dame J. Formal Log. 12(3): 309-321 (1971)
• 
  Charles H. Applebaum:
  Isomorphisms of ω-groups. Notre Dame J. Formal Log. 12(2): 238-248 (1971)
• 
  Ralph C. Applebee, Biswambhar Pahi:
  Some results on generalized truth-tables. Notre Dame J. Formal Log. 12(4): 435-440 (1971)
• 
  William Russell Belding:
  Intuitionistic negation. Notre Dame J. Formal Log. 12(2): 183-187 (1971)
• 
  M. C. Bradley:
  Copi's method of deduction again. Notre Dame J. Formal Log. 12(4): 454-458 (1971)
• 
  Ross T. Brady:
  The consistency of the axioms of abstraction and extensionality in a three-valued logic. Notre Dame J. Formal Log. 12(4): 447-453 (1971)
• 
  John Thomas Canty:
  Elementary logic without referential quantification. Notre Dame J. Formal Log. 12(4): 441-446 (1971)
• 
  E. William Chapin:
  Gentzen-like systems for partial propositional calculi. I. Notre Dame J. Formal Log. 12(1): 75-80 (1971)
• 
  E. William Chapin:
  Gentzen-like systems for partial propositional calculi. II. Notre Dame J. Formal Log. 12(2): 179-182 (1971)
• 
  E. William Chapin:
  The strong decidability of cut-logics. I. Partial propositional calculi. Notre Dame J. Formal Log. 12(3): 322-328 (1971)
• 
  E. William Chapin:
  The strong decidability of cut logics. II. Generalizations. Notre Dame J. Formal Log. 12(4): 429-434 (1971)
• 
  Robert E. Clay:
  A model for Leśniewski's mereology in functions. Notre Dame J. Formal Log. 12(4): 467-478 (1971)
• 
  Robert H. Cowen:
  Superinductive classes in class-set theory. Notre Dame J. Formal Log. 12(1): 62-68 (1971)
• 
  J. C. E. Dekker:
  Two notes on vector spaces with recursive operations. Notre Dame J. Formal Log. 12(3): 329-334 (1971)
• 
  John Donnelly:
  Some remarks on Geach's predicative and attributive adjectives. Notre Dame J. Formal Log. 12(1): 125-128 (1971)
• 
  Jean Drabbe:
  Sur une propriété de préservation. Notre Dame J. Formal Log. 12(4): 505-506 (1971)
• 
  Anton Dumitriu:
  La science de la logique. Notre Dame J. Formal Log. 12(4): 385-405 (1971)
• 
  Erik Ellentuck:
  Incompleteness via simple sets. Notre Dame J. Formal Log. 12(2): 255-256 (1971)
• 
  Melvin Fitting:
  A tableau proof method admitting the empty domain. Notre Dame J. Formal Log. 12(2): 219-224 (1971)
• 
  Laurence Foss:
  Quine on translational indeterminacy. Notre Dame J. Formal Log. 12(2): 195-202 (1971)
• 
  William J. Frascella:
  Certain counterexamples to the construction of combinatorial designs on infinite sets. Notre Dame J. Formal Log. 12(4): 461-466 (1971)
• 
  Frederick S. Gass:
  Generalized ordinal notation. Notre Dame J. Formal Log. 12(1): 104-114 (1971)
• 
  Nadejda Georgieva:
  Independence of the axioms and rules of inference of one system of the extended propositional calculus. Notre Dame J. Formal Log. 12(2): 214-218 (1971)
• 
  Louis F. Goble:
  A system of modality. Notre Dame J. Formal Log. 12(2): 225-237 (1971)
• 
  John R. Gregg:
  Two modes of deductive inference. Notre Dame J. Formal Log. 12(2): 169-178 (1971)
• 
  John H. Harris:
  Ordinal theory in a conservative extension of predicate calculus. Notre Dame J. Formal Log. 12(4): 423-428 (1971)
• 
  Cyril F. A. Hoormann:
  On Hauber's statement of his theorem. Notre Dame J. Formal Log. 12(1): 86-88 (1971)
• 
  Laurent Larouche:
  Examination of the axiomatic foundations of a theory of change. IV. Notre Dame J. Formal Log. 12(3): 378-380 (1971)
• 
  Hugues Leblanc:
  Truth-value semantics for a logic of existence. Notre Dame J. Formal Log. 12(2): 153-168 (1971)
• 
  David Makinson:
  Some embedding theorems for modal logic. Notre Dame J. Formal Log. 12(2): 252-254 (1971)

skipping 28 more matches