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

• 2004
• 
  Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska, Anna B. Romanowska, Jan Wolenski:
  Editorial. Ann. Pure Appl. Log. 126(1-3): 3-4 (2004)
• 
  John W. Addison:
  Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. Ann. Pure Appl. Log. 126(1-3): 77-92 (2004)
• 
  Arnold Beckmann:
  Preservation theorems and restricted consistency statements in bounded arithmetic. Ann. Pure Appl. Log. 126(1-3): 255-280 (2004)
• 
  Pietro Benvenuti, Radko Mesiar:
  On Tarski's contribution to the additive measure theory and its consequences. Ann. Pure Appl. Log. 126(1-3): 281-286 (2004)
• 
  Aleksander Blaszczyk:
  Free Boolean algebras and nowhere dense ultrafilters. Ann. Pure Appl. Log. 126(1-3): 287-292 (2004)
• 
  Solomon Feferman:
  Tarski's conception of logic. Ann. Pure Appl. Log. 126(1-3): 5-13 (2004)
• 
  Jens Erik Fenstad:
  Tarski, truth and natural languages. Ann. Pure Appl. Log. 126(1-3): 15-26 (2004)
• 
  Tadeusz Figiel, Ryszard Frankiewicz, Ryszard Komorowski, Czeslaw Ryll-Nardzewski:
  On hereditarily indecomposable Banach spaces. Ann. Pure Appl. Log. 126(1-3): 293-299 (2004)
• 
  Mario Gómez-Torrente:
  The indefinability of truth in the "Wahrheitsbegriff". Ann. Pure Appl. Log. 126(1-3): 27-37 (2004)
• 
  Magdalena Grzech:
  Set theoretical aspects of the Banach space L_infinitf/c₀. Ann. Pure Appl. Log. 126(1-3): 301-308 (2004)
• 
  Andrzej Grzegorczyk:
  Decidability without mathematics. Ann. Pure Appl. Log. 126(1-3): 309-312 (2004)
• 
  Jaakko Hintikka:
  Independence-friendly logic and axiomatic set theory. Ann. Pure Appl. Log. 126(1-3): 313-333 (2004)
• 
  Henryk Hiz:
  Reexamination of Tarski's semantics. Ann. Pure Appl. Log. 126(1-3): 39-48 (2004)
• 
  Wilfrid Hodges:
  What languages have Tarski truth definitions? Ann. Pure Appl. Log. 126(1-3): 93-113 (2004)
• 
  Tapani Hyttinen, Gabriel Sandu:
  Truth and definite truth. Ann. Pure Appl. Log. 126(1-3): 49-55 (2004)
• 
  Roman Kossak:
  Undefinability of truth and nonstandard models. Ann. Pure Appl. Log. 126(1-3): 115-123 (2004)
• 
  Henryk Kotlarski:
  The incompleteness theorems after 70 years. Ann. Pure Appl. Log. 126(1-3): 125-138 (2004)
• 
  Dexter Kozen:
  Computational inductive definability. Ann. Pure Appl. Log. 126(1-3): 139-148 (2004)
• 
  Joachim Lambek:
  What is the world of mathematics? Ann. Pure Appl. Log. 126(1-3): 149-158 (2004)
• 
  Johann A. Makowsky:
  Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Log. 126(1-3): 159-213 (2004)
• 
  J. Donald Monk:
  The spectrum of maximal independent subsets of a Boolean algebra. Ann. Pure Appl. Log. 126(1-3): 335-348 (2004)
• 
  Jan Mycielski:
  On the tension between Tarski's nominalism and his model theory (definitions for a mathematical model of knowledge). Ann. Pure Appl. Log. 126(1-3): 215-224 (2004)
• 
  Anil Nerode:
  Preface. Ann. Pure Appl. Log. 126(1-3): 1-2 (2004)
• 
  Ilkka Niiniluoto:
  Tarski's definition and truth-makers. Ann. Pure Appl. Log. 126(1-3): 57-76 (2004)
• 
  Benjamin Wells:
  Applying, extending, and specializing pseudorecursiveness. Ann. Pure Appl. Log. 126(1-3): 225-254 (2004)