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

• 1991
• 
  Zofia Adamowicz, Costas Dimitracopoulos:
  On A Problem Concerning Parameter Free Induction. Math. Log. Q. 37(23-24): 363-366 (1991)
• 
  Bernhard Banaschewski:
  Fixpoints Without the Natural Numbers. Math. Log. Q. 37(8): 125-128 (1991)
• 
  Ingo Bandlow:
  A Construction in Set-Theoretic Topology by Means of Elementary Substructures. Math. Log. Q. 37(26-30): 467-480 (1991)
• 
  Stefan Bilaniuk:
  Degrees of Souslin Trees. Math. Log. Q. 37(33-35): 513-524 (1991)
• 
  John Case:
  Effectivizing Inseparability. Math. Log. Q. 37(7): 97-111 (1991)
• 
  Newton C. A. da Costa, V. S. Subrahmanian, Carlo Vago:
  The Paraconsistent Logics PJ. Math. Log. Q. 37(9-12): 139-148 (1991)
• 
  Michael Deutsch:
  Reduktionstyp und Spektrale Darstellung Mit Dem Präfix. Math. Log. Q. 37(18): 273-288 (1991)
• 
  Angel V. Ditchev:
  Effective Enumerations of Families of Finite Sets of Natural Numbers. Math. Log. Q. 37(19-22): 301-306 (1991)
• 
  Rod Downey, Mike Stob:
  Jumps of Hemimaximal Sets. Math. Log. Q. 37(8): 113-120 (1991)
• 
  Narciso García:
  A Theory of Operations on the Universe I. The Theory of Iteration and F-Ordinals. Math. Log. Q. 37(25): 385-392 (1991)
• 
  Narciso García:
  A Theory of Operations on the Universe II. Infinitary Operations. Math. Log. Q. 37(31-32): 481-488 (1991)
• 
  Mai Gehrke:
  The Order Structure of Stone Spaces and the T_D-Separation Axiom. Math. Log. Q. 37(1): 5-15 (1991)
• 
  George Georgescu:
  F-Multipliers and the Localization of Distributive Lattices II. Math. Log. Q. 37(19-22): 293-300 (1991)
• 
  Christoph Gerber, Jürg Schmid:
  The Model Companion of Stone Semilattices. Math. Log. Q. 37(31-32): 501-512 (1991)
• 
  Cyprien Gnanvo:
  Les Tournois (-1)-Chaîne. Math. Log. Q. 37(2-4): 27-37 (1991)
• 
  William S. Hatcher, Marcel Tonga:
  Pairings on Lambda Algebras. Math. Log. Q. 37(19-22): 343-352 (1991)
• 
  Jürgen Hauck:
  Ein Kriterium für die Primitive Rekursivität der Funktional-Iteration. Math. Log. Q. 37(13-16): 193-200 (1991)
• 
  Lutz Heindorf:
  Chains in Boolean Semigroup Algebras. Math. Log. Q. 37(5-6): 93-96 (1991)
• 
  Lauri Hella, Michal Krynicki:
  Remarks on The Cartesian Closure. Math. Log. Q. 37(33-35): 539-545 (1991)
• 
  Armin Hemmerling:
  Pebble Automata in Labyrinths with Rotation Systems. Math. Log. Q. 37(26-30): 453-466 (1991)
• 
  Ulrich Huckenbeck:
  Some Elementary Results About the Equivalence of Computability and Decidability. Math. Log. Q. 37(5-6): 77-84 (1991)
• 
  Taneli Huuskonen:
  The Construction of A Definable Non-Categorical Domain. Math. Log. Q. 37(13-16): 217-226 (1991)
• 
  Pierre Ille:
  L'ensemble des Intervalles d'une Multirelation Binaire et Reflexive. Math. Log. Q. 37(13-16): 227-256 (1991)
• 
  Matt Insall:
  Nonstandard Methods and Finiteness Conditions in Algebra. Math. Log. Q. 37(33-35): 525-532 (1991)
• 
  Yasuo Kanai:
  On A Variant of Weak Chang's Conjecture. Math. Log. Q. 37(19-22): 289-292 (1991)
• 
  Kyriakos Keremedis:
  A Note on Shoenfield's Unramified Forcing. Math. Log. Q. 37(9-12): 183-186 (1991)
• 
  Kyriakos Kontostathis:
  Topological Framework for Non-Priority. Math. Log. Q. 37(31-32): 495-500 (1991)
• 
  Jan Kuper:
  An Application of Non-Wellfounded Sets to the Foundations of Geometry. Math. Log. Q. 37(17): 257-264 (1991)
• 
  Andrei A. Kuzichev:
  Church-Rosser Property for Some Extensions of λβ-Reducibility Relation. Math. Log. Q. 37(33-35): 547-559 (1991)
• 
  Manuel Lerman:
  Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets. Math. Log. Q. 37(19-22): 331-342 (1991)

skipping 29 more matches