[Prev][Next][Index][Thread]

ANNALS OF PURE AND APPLIED LOGIC: Call for CS Submissions


		     ANNALS OF PURE AND APPLIED LOGIC
	   Call for Submissions in Theoretical Computer Science

The editors of the Annals of Pure and Applied Logic would be pleased to
receive further submissions in areas of theoretical Computer Science and
foundations of computing.  The journal has, for nearly three decades, been
covering the basic topics in Mathematical Logic that are significant for
the sake of logic itself but also for application in Computer Science and
Mathematics.

A good deal of material of interest to theoretical computer scientists has
already been published on such topics as domain theory, linear logic,
lambda calculus, type-theory and complexity theory--including a Special
Issue (and another forthcoming) of selected papers presented at the IEEE
Symposium on Logic in Computer Science.  A sample of Computer Science
related papers published thus far in 1991-2 appears below.

Manuscripts can be submitted to any of the managing editors listed below.
The current BACKLOG (time from final acceptance to publication) is SIX
MONTHS--considerably less than the other major journals covering the area.

                           MANAGING EDITORS
D. van Dalen
Co-ordinating Editor
(Constructive Logic/Mathematics, Categorical Logic)
Mathematisch Institute
Rijksuniversiteit Utrecht
Postbus 80.010
3508 TA Utrecht
Netherlands
dvdalen@math.ruu.nl

S. N. Artemov
(Proof Theory, Logic and Computer Science)
Steklov Mathematical Institute
Vavilova 42
117966 Moscow GSP-1
Russia
art@log.mian.su

J.-Y. Girard
(Proof Theory)
16 bis rue Sibuet
75012 Paris
France
girard@margaux.inria.fr

Y. Gurevich
(Logic and Computer Science)
EECS Department
University of Michigan
Ann Arbor, MI 48109-2122
United States
gurevich@dip.eecs.umich.edu

T. Jech
(Set Theory)
Mathematics Department
The Pennsylvania State University
University Park, PA 16802
United States

A. Lachlan
(Model Theory)
Department of Mathematics and Statistics
Simon Fraser University
Burnaby, British Columbia
Canada V5A 1S6

A. R. Meyer
(Logic in Computer Science, Complexity Theory)
Laboratory for Computer Science
Massachusetts Institute of Technology
545 Technology Square
Cambridge, MA 02139
United States
meyer@theory.lcs.mit.edu

A. Nerode
(Recursion Theory, Logic and Computer Science)
Department of Mathematics
Cornell University
White Hall
Ithaca, NY 14853-7901
United States
anil@mssun7.msi.cornell.edu

A. Prestel
(Model Theory)
Mathematisches Institute der Universitaet
Postfach 5560
W-7750 Konstanz
Germany


	      Recent papers in Theoretical Computer Science
	      ---------------------------------------------

Samson Abramsky.  Domain theory in logical form.  APAL 51(1-2):1--77.
March 1991.

Bill Allen.  Arithmetizing Uniform NC.  APAL 53(1):1--50.  July
1991.

Matthias Baaz and Alexander Leitsch.  Complexity of resolution proofs
and function introduction.  APAL 57(3): 181-215. June 1992.

Andreas Blass.  A game semantics for linear logic.  APAL
56(1-3):183--220.  April 1992.

Samuel R. Buss.  Propositional consistency proofs.  APAL 52(1-2):
3--29. April 1991.

P. Clote and G. Takeuti.  Bounded arithmetic for NC, ALogTIME, L and
NL.  APAL 56(1-3):73--117.  April 1992.

Jean H. Gallier.  What's so special about Kruskal's theorem and the
ordinal Gamma_0?  A survey of some results in proof theory.  APAL
53(3): 199--260.  September 1991.

Patrick Lincoln, John Mitchell, Andre Scedrov and Natarajan Shankar.
Decision problems for propositional linear logic.  APAL
56(1-3):239--311.  April 1992.

W. Marek, A. Nerode and J. Remmel.  How complicated is the set of
stable models of a recursive logic program?  APAL 56(1-3):119--135.
April 1992.

Nax Paul Mendler.  Inductive types and type constraints in the
second-order lambda calculus.  APAL 51(1-2):159--172.  March 1991.

Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov.
Uniform proofs as a foundation for logic programming.  APAL
51(1-2):125--157.  March 1991.

John C. Mitchell and Eugenio Moggi.  Kripke-style models for typed
lambda calculus.  APAL 51(1-2):99--124.  March 1991.

J. C. Shepherdson.  Mints type deductive calculi for logic
programming.  APAL 56(1-3):7--17.  April 1992.

Moshe Y. Vardi.  Verification of concurrent programs: the
automata-theoretic framework.  APAL 51(1-2):79--98.  March 1991.

Marek Zaionc.  lambda-definability on free algebras.  APAL 51(3):279--300.
March 1991.

---------
For further information you may contact the Publisher:
   A. Sevenster
   Mathematics, Computer Science and Cognitive Science
   Elsevier Science Publishers
   P.O. Box 103
   1000 AC AMSTERDAM
   email: A.SEVENSTER@elsevier.nl

END