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

• 1973
• 
  David Meredith:
  On a property of certain propositional formulae. Notre Dame J. Formal Log. 14(1): 103-106 (1973)
• 
  Alexander Abian:
  Rado's theorem and solvability of systems of equations. Notre Dame J. Formal Log. 14(2): 145-150 (1973)
• 
  Charles H. Applebaum:
  A stronger definition of a recursively infinite set. Notre Dame J. Formal Log. 14(3): 411-412 (1973)
• 
  Earline Jennifer Ashworth:
  Andreas Kesler and the later theory of consequence. Notre Dame J. Formal Log. 14(2): 205-214 (1973)
• 
  Earline Jennifer Ashworth:
  The theory of consequence in the late fifteenth and early sixteenth centuries. Notre Dame J. Formal Log. 14(3): 289-315 (1973)
• 
  John Bacon:
  Kripke's deontic semantics again. Notre Dame J. Formal Log. 14(4): 581-582 (1973)
• 
  R. J. Baxter:
  On some models of modal logics. Notre Dame J. Formal Log. 14(1): 121-122 (1973)
• 
  William Russell Belding:
  Incidence rings of pre-ordered sets. Notre Dame J. Formal Log. 14(4): 481-509 (1973)
• 
  William Russell Belding, Richard L. Poss:
  A note on: "Transitivity, supertransitivity and induction". Notre Dame J. Formal Log. 14(4): 565-566 (1973)
• 
  David W. Bennett:
  An elementary completeness proof for a system of natural deduction. Notre Dame J. Formal Log. 14(3): 430-432 (1973)
• 
  Stephen L. Bloom:
  Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem. Notre Dame J. Formal Log. 14(3): 408-410 (1973)
• 
  Alex Blum:
  A correction in Copi's account of Boolean normal forms. Notre Dame J. Formal Log. 14(2): 288 (1973)
• 
  Dorothy Bollman, Miguel Laplaza:
  A set-theoretic model for nonassociative number theory. Notre Dame J. Formal Log. 14(1): 107-110 (1973)
• 
  M. C. Bradley:
  Errata: "Copi's method of deduction again". Notre Dame J. Formal Log. 14(4): 584 (1973)
• 
  Arthur M. Bullock, Hubert H. Schneider:
  On generating the finitely satisfiable formulas. Notre Dame J. Formal Log. 14(3): 373-376 (1973)
• 
  Martin W. Bunder:
  A generalised Kleene-Rosser paradox for a system containing the combinator K. Notre Dame J. Formal Log. 14(1): 53-54 (1973)
• 
  Martin W. Bunder:
  A deduction theorem for restricted generality. Notre Dame J. Formal Log. 14(3): 341-346 (1973)
• 
  Alan Bundy:
  A note on omitting the replacement schema. Notre Dame J. Formal Log. 14(1): 118-120 (1973)
• 
  Terrell Ward Bynum:
  On an alleged contradiction lurking in Frege's Begriffsschrift. Notre Dame J. Formal Log. 14(2): 285-287 (1973)
• 
  E. William Chapin, S. Michael Webb:
  A non-standard proof in the theory of integration. Notre Dame J. Formal Log. 14(1): 125-128 (1973)
• 
  John R. Chidgey:
  A note on transitivity. Notre Dame J. Formal Log. 14(2): 273-275 (1973)
• 
  Robert E. Clay:
  Two results in Leśniewski's mereology. Notre Dame J. Formal Log. 14(4): 559-564 (1973)
• 
  Kenneth W. Collier:
  Physical modalities and the system E. Notre Dame J. Formal Log. 14(2): 185-194 (1973)
• 
  Nicholas J. DeLillo:
  A formal characterization of ordinal numbers. Notre Dame J. Formal Log. 14(3): 397-400 (1973)
• 
  Theodore C. Denise:
  The two logics: traditional and modern. Notre Dame J. Formal Log. 14(4): 510-518 (1973)
• 
  Erik Ellentuck:
  Degrees of isolic theories. Notre Dame J. Formal Log. 14(3): 331-340 (1973)
• 
  P. J. Fitzpatrick:
  An extension of Venn diagrams. Notre Dame J. Formal Log. 14(1): 77-86 (1973)
• 
  William J. Frascella:
  A stronger theorem concerning the non-existence of combinatorial designs on infinite sets. Notre Dame J. Formal Log. 14(4): 554-558 (1973)
• 
  Peter Gärdenfors:
  On the extensions of S5. Notre Dame J. Formal Log. 14(2): 277-280 (1973)
• 
  James W. Garson:
  The completeness of an intensional logic: definite topological logic. Notre Dame J. Formal Log. 14(2): 175-184 (1973)

skipping 55 more matches