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

• 1988
• 
  Branislav R. Boricic:
  A note on sequent calculi intermediate between LJ and LK. Stud Logica 47(2): 151-157 (1988)
• 
  Michael Böttner:
  A note on existential import. Stud Logica 47(1): 35-40 (1988)
• 
  Ross T. Brady:
  A content semantics for quantified relevant logics. I. Stud Logica 47(2): 111-127 (1988)
• 
  Martin W. Bunder:
  Arithmetic based on the Church numerals in illative combinatory logic. Stud Logica 47(2): 129-143 (1988)
• 
  Wojciech Buszkowski:
  Gaifman's theorem on categorial grammars revisited. Stud Logica 47(1): 23-33 (1988)
• 
  Francesco Caro:
  Graded modalities, II (canonical models). Stud Logica 47(1): 1-10 (1988)
• 
  Francesco Caro:
  Normal predicative logics with graded modalities. Stud Logica 47(1): 11-22 (1988)
• 
  M. J. Cresswell:
  Necessity and contingency. Stud Logica 47(2): 145-149 (1988)
• 
  László Csirmaz:
  Stability of weak second-order semantics. Stud Logica 47(3): 193-202 (1988)
• 
  Janusz Czelakowski:
  Books received. Stud Logica 47(1): 71-77 (1988)
• 
  Janusz Czelakowski:
  Books received. Stud Logica 47(2): 169-176 (1988)
• 
  Janusz Czelakowski:
  Books received. Stud Logica 47(4): 439-441 (1988)
• 
  Herman Dishkant:
  Mathematics of Totalities: an alternative to mathematics of sets. Stud Logica 47(4): 319-326 (1988)
• 
  Kosta Dosen:
  Sequent-systems and groupoid models. I. Stud Logica 47(4): 353-385 (1988)
• 
  E. J. Farkas:
  A faithful embedding of parallel computations in star-finite models. Stud Logica 47(3): 203-212 (1988)
• 
  Maurizio Fattorosi-Barnaba, Claudio Cerrato:
  Graded modalities. III (the completeness and compactness of S40). Stud Logica 47(2): 99-110 (1988)
• 
  Melvin Fitting:
  Pseudo-Boolean valued prolog. Stud Logica 47(2): 85-91 (1988)
• 
  Adam Gajda:
  The adequacy condition as a definition of elementary interpretation. Stud Logica 47(1): 57-69 (1988)
• 
  Michal Grabowski:
  Arithmetical completeness versus relative completeness. Stud Logica 47(3): 213-220 (1988)
• 
  Joram Hirshfeld:
  Nonstandard combinatorics. Stud Logica 47(3): 221-232 (1988)
• 
  Tsutomu Hosoi:
  Gentzen-type formulation of the prepositional logic LQ. Stud Logica 47(1): 41-48 (1988)
• 
  Dexter Kozen:
  A finite model theorem for the propositional μ-calculus. Stud Logica 47(3): 233-241 (1988)
• 
  Michal Krynicki:
  The non-definability notion and first order logic. Stud Logica 47(4): 429-437 (1988)
• 
  Steven C. Leth:
  Sequences in countable nonstandard models of the natural numbers. Stud Logica 47(3): 243-263 (1988)
• 
  Steven C. Leth:
  Some nonstandard methods in combinatorial number theory. Stud Logica 47(3): 265-278 (1988)
• 
  Renato A. Lewin:
  Involutions defined by monadic terms. Stud Logica 47(4): 387-389 (1988)
• 
  José M. Méndez:
  Converse Ackermann Croperty and semiclassical negation. Stud Logica 47(2): 159-168 (1988)
• 
  Hiroakira Ono:
  On finite linear intermediate predicate logics. Stud Logica 47(4): 391-399 (1988)
• 
  Renato H. L. Pedrosa, Antonio M. A. Sette:
  A representation theorem for languages with generalized quantifiers through back-and-forth methods. Stud Logica 47(4): 401-411 (1988)
• 
  Michael M. Richter, Manfred E. Szabo:
  Nonstandard methods in combinatorics and theoretical computer science. Stud Logica 47(3): 181-191 (1988)

skipping 8 more matches