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

• 2005
• 
  Aldo Antonelli, Robert May:
  Frege's Other Program. Notre Dame J. Formal Log. 46(1): 1-17 (2005)
• 
  O. Bradley Bassler:
  Book Review: J. P. Mayberry. Foundations of Mathematics in the Theory of Sets. Notre Dame J. Formal Log. 46(1): 107-125 (2005)
• 
  Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi:
  Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46(1): 51-64 (2005)
• 
  Merrie Bergmann:
  Finite Tree Property for First-Order Logic with Identity and Functions. Notre Dame J. Formal Log. 46(2): 173-180 (2005)
• 
  Katalin Bimbó, J. Michael Dunn:
  Relational Semantics for Kleene Logic and Action Logic. Notre Dame J. Formal Log. 46(4): 461-490 (2005)
• 
  Martin W. Bunder, W. J. M. Dekkers:
  Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic. Notre Dame J. Formal Log. 46(2): 181-205 (2005)
• 
  Patrizio Cintioli:
  Sets without Subsets of Higher Many-One Degree. Notre Dame J. Formal Log. 46(2): 207-216 (2005)
• 
  Julian C. Cole:
  Book Review: Jody Azzouni. Deflating Existential Consequence: A Case for Nominalism. Notre Dame J. Formal Log. 46(2): 235-247 (2005)
• 
  James Cummings:
  Notes on Singular Cardinal Combinatorics. Notre Dame J. Formal Log. 46(3): 251-282 (2005)
• 
  Mirna Dzamonja:
  Club Guessing and the Universal Models. Notre Dame J. Formal Log. 46(3): 283-300 (2005)
• 
  Todd Eisworth:
  On Ideals Related to I[λ]. Notre Dame J. Formal Log. 46(3): 301-307 (2005)
• 
  Fernando Ferreira:
  A Simple Proof of Parsons' Theorem. Notre Dame J. Formal Log. 46(1): 83-91 (2005)
• 
  Matthew Foreman:
  Introduction to the Special Issue on Singular Cardinals Combinatorics. Notre Dame J. Formal Log. 46(3): 249 (2005)
• 
  Matthew Foreman:
  Some Problems in Singular Cardinals Combinatorics. Notre Dame J. Formal Log. 46(3): 309-322 (2005)
• 
  Mauro Gattari:
  Finite and Physical Modalities. Notre Dame J. Formal Log. 46(4): 425-437 (2005)
• 
  Philipp Gerhardy:
  The Role of Quantifier Alternations in Cut Elimination. Notre Dame J. Formal Log. 46(2): 165-171 (2005)
• 
  Moti Gitik:
  Around Silver's Theorem. Notre Dame J. Formal Log. 46(3): 323-325 (2005)
• 
  Rosalie Iemhoff:
  Intermediate Logics and Visser's Rules. Notre Dame J. Formal Log. 46(1): 65-81 (2005)
• 
  José Iovino:
  Definable Types Over Banach Spaces. Notre Dame J. Formal Log. 46(1): 19-50 (2005)
• 
  Tetsuya Ishiu:
  A Tail Club Guessing Ideal Can Be Saturated without Being a Restriction of the Nonstationary Ideal. Notre Dame J. Formal Log. 46(3): 327-333 (2005)
• 
  Aleksander Ivanov:
  Automorphisms of Homogeneous Structures. Notre Dame J. Formal Log. 46(4): 419-424 (2005)
• 
  Raymond E. Jennings, Kam Sing Leung:
  A Deontic Counterpart of Lewis's S1. Notre Dame J. Formal Log. 46(2): 217-230 (2005)
• 
  Joost J. Joosten:
  The Closed Fragment of the Interpretability Logic of PRA with a Constant for. Notre Dame J. Formal Log. 46(2): 127-146 (2005)
• 
  Jean A. Larson:
  Ramsey Theory for Countable Binary Homogeneous Structures. Notre Dame J. Formal Log. 46(3): 335-352 (2005)
• 
  Juan Carlos Martínez:
  Some Open Questions for Superatomic Boolean Algebras. Notre Dame J. Formal Log. 46(3): 353-356 (2005)
• 
  William J. Mitchell:
  Adding Closed Unbounded Subsets of ω₂ with Finite Forcing. Notre Dame J. Formal Log. 46(3): 357-371 (2005)
• 
  Anand Pillay, Evgueni Vassiliev:
  On Lovely Pairs and the (∃ y ∈ P) Quantifier. Notre Dame J. Formal Log. 46(4): 491-501 (2005)
• 
  Stephen Pollard:
  The Expressive Unary Truth Functions of n-valued Logic. Notre Dame J. Formal Log. 46(1): 93-105 (2005)
• 
  N. Raja:
  A Negation-free Proof of Cantor's Theorem. Notre Dame J. Formal Log. 46(2): 231-233 (2005)
• 
  Eric Rosen:
  On the First-Order Prefix Hierarchy. Notre Dame J. Formal Log. 46(2): 147-164 (2005)

skipping 6 more matches