Annals of Pure and Applied Logic, Volume 51

Volume 51, Numbers 1-2, 1991

• Samson Abramsky:
  Domain Theory in Logical Form. 1-77
  
• Moshe Y. Vardi:
  Verification of Concurrent Programs: The Automata-Theoretic Framework. 79-98
  
• John C. Mitchell, Eugenio Moggi:
  Kripke-Style Models for Typed lambda Calculus. 99-124
  
• Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov:
  Uniform Proofs as a Foundation for Logic Programming. 125-157
  
• N. P. Mendler:
  Inductive Types and Type Constraints in the Second-Order lambda Calculus. 159-172
  

Volume 51, Number 3, 23 March 1991

• William M. Farmer:
  A Unification-Theoretic Method for Investigating the k-Provability Problem. 173-214
  
• Moti Gitik:
  The Strength of the Failure of the Singular Cardinal Hypothesis. 215-240
  
• Angus Macintyre:
  Schanuel's Conjecture and Free Exponential Rings. 241-246
  
• Claude Sureson:
  About Prikry Generic Extensions. 247-278
  
• Marek Zaionc:
  lambda-Definability on Free Algebras. 279-300
  

Last update Sat May 25 15:28:41 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page