• 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 34 matches

• 1997
• 
  Jon Barwise:
  Information and Impossibilities. Notre Dame J. Formal Log. 38(4): 488-515 (1997)
• 
  S. V. Bhave:
  Situations in Which Disjunctive Syllogism Can Lead from True Premises to a False Conclusion. Notre Dame J. Formal Log. 38(3): 398-405 (1997)
• 
  Rich Blaylock, Rodney G. Downey, Steffen Lempp:
  Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame J. Formal Log. 38(3): 406-418 (1997)
• 
  Carsten Butz:
  Syntax and Semantics of the Logic L^λ_ωω. Notre Dame J. Formal Log. 38(3): 374-384 (1997)
• 
  Sergio A. Celani, Ramon Jansana:
  A New Semantics for Positive Modal Logic. Notre Dame J. Formal Log. 38(1): 1-18 (1997)
• 
  Ambar Chowdhury, Bradd Hart:
  An Unclassifiable Unidimensional Theory without OTOP. Notre Dame J. Formal Log. 38(1): 93-103 (1997)
• 
  Newton C. A. da Costa, Décio Krause:
  An Intensional Schrödinger Logic. Notre Dame J. Formal Log. 38(2): 179-194 (1997)
• 
  Paola D'Aquino:
  Toward the Limits of the Tennebaum Phenomenon. Notre Dame J. Formal Log. 38(1): 81-92 (1997)
• 
  Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, Betti Venneri:
  The "Relevance" of Intersection and Union Types. Notre Dame J. Formal Log. 38(2): 246-269 (1997)
• 
  Chrysafis Hartonas:
  An Algebraic Theory of Structured Objects. Notre Dame J. Formal Log. 38(1): 65-80 (1997)
• 
  Richard G. Heck Jr.:
  Grundgesetze der Arithmetik I: Paragraphen 29-32. Notre Dame J. Formal Log. 38(3): 437-474 (1997)
• 
  John T. Kearns:
  Propositional Logic of Supposition and Assertion. Notre Dame J. Formal Log. 38(3): 325-349 (1997)
• 
  Bakhadyr Khoussainov, André Nies, Richard A. Shore:
  Computable Models of Theories with Few Models. Notre Dame J. Formal Log. 38(2): 165-178 (1997)
• 
  Philip Kremer:
  Propositional Quantification in the Topological Semantics for S4. Notre Dame J. Formal Log. 38(2): 295-313 (1997)
• 
  David A. Vander Laan:
  The Ontology of Impossible Worlds. Notre Dame J. Formal Log. 38(4): 597-620 (1997)
• 
  Edwin D. Mares:
  Who's Afraid of Impossible Worlds? Notre Dame J. Formal Log. 38(4): 516-526 (1997)
• 
  Genoveva Martí:
  Rethinking Quine's Argument on the Collapse of Modal Distinctions. Notre Dame J. Formal Log. 38(2): 276-294 (1997)
• 
  Chris Mortensen:
  Peeking at the Impossible. Notre Dame J. Formal Log. 38(4): 527-534 (1997)
• 
  Wallace A. Murphree:
  The Numerical Syllogism and Existential Presupposition. Notre Dame J. Formal Log. 38(1): 49-64 (1997)
• 
  Daniel Nolan:
  Impossible Worlds: A Modest Approach. Notre Dame J. Formal Log. 38(4): 535-572 (1997)
• 
  Karim Nour:
  A Conjecture on Numeral Systems. Notre Dame J. Formal Log. 38(2): 270-275 (1997)
• 
  Anthony F. Peressini:
  Cumulative versus Noncumulative Ramified Types. Notre Dame J. Formal Log. 38(3): 385-397 (1997)
• 
  Ian E. Pratt, Oliver Lemon:
  Ontologies for Plane, Polygonal Mereotopology. Notre Dame J. Formal Log. 38(2): 225-245 (1997)
• 
  Graham Priest:
  Impossible Worlds - Editor's Introduction. Notre Dame J. Formal Log. 38(4): 481-487 (1997)
• 
  Graham Priest:
  Sylvan's Box: a Short Story and Ten Morals. Notre Dame J. Formal Log. 38(4): 573-582 (1997)
• 
  Greg Restall:
  Ways Things Can't Be. Notre Dame J. Formal Log. 38(4): 583-596 (1997)
• 
  Mark Reynolds:
  A Decidable Temporal Logic of Parallelism. Notre Dame J. Formal Log. 38(3): 419-436 (1997)
• 
  Victor Rodych:
  Wittgenstein on Mathematical Meaningfulness, Decidability, and Application. Notre Dame J. Formal Log. 38(2): 195-224 (1997)
• 
  John C. Simms:
  Another Characterization of Alephs: Decompositions of Hyperspace. Notre Dame J. Formal Log. 38(1): 19-36 (1997)
• 
  Osamu Takaki:
  Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction. Notre Dame J. Formal Log. 38(3): 350-373 (1997)

skipping 4 more matches