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

• 2007
• 
  John T. Baldwin:
  The Vaught Conjecture: Do Uncountable Models Count? Notre Dame J. Formal Log. 48(1): 79-92 (2007)
• 
  Stephen Binns:
  Hyperimmunity in 2^ℕ. Notre Dame J. Formal Log. 48(2): 293-316 (2007)
• 
  Riccardo Camerlo:
  Finiteness Axioms on Fragments of Intuitionistic Set Theory. Notre Dame J. Formal Log. 48(4): 473-488 (2007)
• 
  Peter Cholak:
  Introduction to the Special Issue on Vaught's Conjecture. Notre Dame J. Formal Log. 48(1): 1-2 (2007)
• 
  Alfred Dolich:
  A Note on Weakly O-Minimal Structures and Definable Completeness. Notre Dame J. Formal Log. 48(2): 281-292 (2007)
• 
  Su Gao:
  Complexity Ranks of Countable Models. Notre Dame J. Formal Log. 48(1): 33-48 (2007)
• 
  Eric J. Hall:
  Permutation Models and SVC. Notre Dame J. Formal Log. 48(2): 229-235 (2007)
• 
  Charles M. Harris:
  On the Symmetric Enumeration Degrees. Notre Dame J. Formal Log. 48(2): 175-204 (2007)
• 
  Alexander Hertel, Philipp Hertel, Charles Morgan:
  A Sound and Complete Proof Theory for Propositional Logical Contingencies. Notre Dame J. Formal Log. 48(4): 521-530 (2007)
• 
  Denis R. Hirschfeldt, Russell G. Miller, Sergei Podzorov:
  Order-Computable Sets. Notre Dame J. Formal Log. 48(3): 317-347 (2007)
• 
  Greg Hjorth:
  A Note on Counterexamples to the Vaught Conjecture. Notre Dame J. Formal Log. 48(1): 49-51 (2007)
• 
  Aleksander Ivanov, K. Majcher:
  Ages of Expansions of ω-Categorical Structures. Notre Dame J. Formal Log. 48(3): 371-380 (2007)
• 
  Joost J. Joosten:
  Propositional Proof Systems and Fast Consistency Provers. Notre Dame J. Formal Log. 48(3): 381-398 (2007)
• 
  Michael Kaminski, Michael L. Tiomkin:
  The Modal Logic of Cluster-Decomposable Kripke Interpretations. Notre Dame J. Formal Log. 48(4): 511-520 (2007)
• 
  Richard Kaye, Tin Lok Wong:
  On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Log. 48(4): 497-510 (2007)
• 
  R. W. Knight:
  Categories of Topological Spaces and Scattered Theories. Notre Dame J. Formal Log. 48(1): 53-77 (2007)
• 
  Martin Kummer, Marcus Schäfer:
  Cuppability of Simple and Hypersimple Sets. Notre Dame J. Formal Log. 48(3): 349-369 (2007)
• 
  Karen M. Lange, Robert I. Soare:
  Computability of Homogeneous Models. Notre Dame J. Formal Log. 48(1): 143-170 (2007)
• 
  Michael C. Laskowski:
  An Old Friend Revisited: Countable Models of ω-Stable Theories. Notre Dame J. Formal Log. 48(1): 133-141 (2007)
• 
  Alberto Marcone:
  Interval Orders and Reverse Mathematics. Notre Dame J. Formal Log. 48(3): 425-448 (2007)
• 
  Edwin D. Mares:
  The Fact Semantics for Ramified Type Theory and the Axiom of Reducibility. Notre Dame J. Formal Log. 48(2): 237-251 (2007)
• 
  David Marker:
  The Borel Complexity of Isomorphism for Theories with Many Types. Notre Dame J. Formal Log. 48(1): 93-97 (2007)
• 
  David Marker:
  The Number of Countable Differentially Closed Fields. Notre Dame J. Formal Log. 48(1): 99-113 (2007)
• 
  José Martínez-Fernández:
  Maximal Three-Valued Clones with the Gupta-Belnap Fixed-Point Property. Notre Dame J. Formal Log. 48(4): 449-472 (2007)
• 
  Ludomir Newelski:
  Relative Vaught's Conjecture for Some Meager Groups. Notre Dame J. Formal Log. 48(1): 115-132 (2007)
• 
  Michael Rescorla:
  Church's Thesis and the Conceptual Analysis of Computability. Notre Dame J. Formal Log. 48(2): 253-280 (2007)
• 
  Gerald E. Sacks:
  Bounds on Weak Scattering. Notre Dame J. Formal Log. 48(1): 5-31 (2007)
• 
  Katsuhiko Sano, Kentaro Sato:
  Semantical Characterizations for Irreflexive and Generalized Modal Languages. Notre Dame J. Formal Log. 48(2): 205-228 (2007)
• 
  Philip Scowcroft:
  The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups. Notre Dame J. Formal Log. 48(4): 521-550 (2007)
• 
  Daisuke Souma:
  An Algebraic Approach to the Disjunction Property of Substructural Logics. Notre Dame J. Formal Log. 48(4): 489-495 (2007)

skipping 1 more match