Wanted

Hello,

as I routinely do, I'd like to ask for some help in getting papers 
for our Groucho archive. Please donate some of your time to Groucho. 
The following is a list of papers I'm currently having trouble to 
find.

Please help by sending me a scan (better) or a photocopy of the 
papers you're able to find.

Thanks!

-Alessio


Sequent systems for modal logics, in: Handbook of Philosophical Logic,
Vol 8 , ed.  by D. Gabbay and F. Guenthner, Kluwer Academic Publishers,
2002, 61-145.

Sergei Artemov on ~ `Proof carrying formulas and reflective
lambda-calculus'

Belnap, "Tonk, plonk and plink", Analysis, 22, 1962 (should be in P.F.
Strawson ed.  "Philosophical logic" OUP 1967 (Oxford).)

@Article(Birk35,
Author="Birkhoff, G.",
Title="On the structure of abstract algebras",
Journal="Proc. Cambridge Phil. Soc",
Volume=31, Pages="433-454", Year=1935)

@Article(
Bir33,  Author="Birkhoff, G.",
Title="On the combination of subalgebras",
Journal="Proc. Cambridge Phil. Soc",
Volume=29, Pages="441-464", Year=1933)

M. D' Agostino.  Are tableaux an improvement on truth-tables?  cut free
proofs and bivalence.  Journal of Logic, Language and Information, 1992.

Feferman, Solomon.  "Mathematical intuition vs.  mathematical monsters."
Synthese 125, no.  3 (2000): 317-332.

H. Friedman, Internal Finite Tree Embeddings, in: Reflections on the
foundations of mathematics, Essays in Honor of Solomon Feferman, Ed.
Sieg, Sommer, Talcott, Lecture Notes in Logic, ASL, 2002.

Harvey Friedman.  Equality Between Functionals, Logic Colloquium,
Springer Lecture Notes, Vol.  453, (1975), pp.  22-37.

Lew Gordeev, Cut free formalization of logic with finitely many
variables, Part I, Proc.  CSL'94, LN in Comp.  Sci.  933 (1995),
135-150.

Hacking on atomic weakening and contraction reprinted in Gabbay's `What
is a logical system?'

Andre' Joyal, Foncteurs analytiques et especes de structures, in
Combinatoire Enumerative (Montreal, Quebec, 1985), Lecture Notes in
Mathematics 1234, Springer, 1986.

Krajicek J. Pudlak P.: The number of proof lines and the size of proofs
in first order logic, Arch.  Math.  Log.  Vol.27, 1988 pp.69-84.

Krajicek J. Pudlak P. Takeuti G.: Bounded arithmetic and polynomial
hierarchy, Annals of Pure and Applied Logic 52,(1991), pp.143-154.

Lawvere, "Adjointness in Foundations", Dialectica, 23, 1969 (ISSN:
0012-2017 Signatur: Y. 8.  6063 Auslage CA 2900 Fachgruppe CA Wo:
Neubau)

@InProceedings(Pr95c,
Author="Pratt, V.R.",
Title="The {S}tone Gamut: A Coordinatization of Mathematics",
BookTitle="Logic in Computer Science", Pages="444-454",
Month="June", Publisher="IEEE Computer Society", Year="1995")

@Article(Pri70,
Author="Priestley, H.A.",
Title="Representation of distributive lattices",
Journal="Bull. London Math. Soc.", Volume=2,
Pages="186-190", Year=1970)

Prawitz, "Meaning and proofs", Theoria, 43, 1977

Prior, "The runabout inference-ticket", Analysis, 21, 1969 (should be in
P.F. Strawson ed.  "Philosophical logic" OUP 1967 (Oxford).)

Pudlak P.: Logic and Complexity: Independence results and the complexity
of propositional calculus, in Proc.  Internat.  Congress of Math.,
Zurich, 1994 (45 min.  invited lecture), pp.288-297.

Pudlak P.: The lengths of proofs, in Handbook of Proof Theory, S.R. Buss
ed., Elsevier, 1998, pp.547-637.  (BARCODE 30440629 Regalstandort
SK1308981 Informatik)

H. Schellinx, Some syntactical observations on linear logic, J. Logic
Comput.  1(4) (1991) 537{559.

Schuette - Ein System des verknuepfenden Schliessens - Archiv fuer
mathematische Logik und Grundlagenforschung, vol.  2 (1954-56), pp.
55-67.  (Barcode XMOM 1088241 Regalstandort Y. 8.  1241
Zentralbibliothek Zellescherweg Magazin Zeitschriften)

R. Statman.  Bounds for proof-search and speed-up in predicate calculus.
Annals of Mathematical Logic, 15:225-287, 1978.

R. Statman, The typed lambda-calculus is not elementary recursive,
Theoretical Computer Science 9 (1979) 73-81.

@Article(Sto34,
Author="Stone, M.",
Title="{B}oolean algebras and their applications to topology",
Journal="Proc. Nat. Acad. Sci.", Volume=20, Pages="197-202", Year=1934)

@Article(Sto37,
Author="Stone, M.",
Title="Topological representations of distributive lattices and
Brouwerian logics",
Journal="\v Casopis P\v est. Math.", Volume=67, Pages="1-25",
Year=1937)

Tait - Normal derivability in classical logic - LNM 72, Springer 1968.

A. Urquhart.  The relative complexity of resolution and cut-free gentzen
systems.  Annals of Mathematics and Artificial intelligence, 6:157--168,
1992.

A. Urquhart.  The complexity of Gentzen systems for propositional logic.
Theoretical Computer Science, Volume 66, Issue 1 (August 1989).