| 1997 | Existential Instantiation and Strong Normalization. | Grigori Mints |
| 1997 | Some Decision Problems for Traces. | Yuri V. Matiyasevich |
| 1997 | Case Study: Additive Linear Logic and Lattices. | Jean-Yves Marion |
| 1997 | Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. | Maurice Margenstern |
| 1997 | Basic Forward Chaining Construction for Logic Programs. | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1997 | A Proof Procedure for Hereditary Harrop Formulas with Free Equality. | Evgeny Makarov |
| 1997 | Functions for the General Solution of Parametric Word Equations. | G. S. Makanin, Habib Abdulrab, Pavel Goralcik |
| 1997 | On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. | Alexei Lisitsa, Vladimir Yu. Sazonov |
| 1997 | Operational Logic of Proofs with Functionality Condition on Proof Predicate. | Vladimir Krupski |
| 1997 | The Undecidability of Second Order Linear Affine Logic. | Alexey P. Kopylov |
| 1997 | On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces. | Bernhard Heinemann |
| 1997 | Towards a Theory of Recursive Structures (extended abstract). | David Harel |
| 1997 | An Algebraic Correctness Criterion for Intuitionistic Proof-Nets. | Philippe de Groote |
| 1997 | Finite Bases of Admissible Rules for the Logic S52C. | Mikhail Golovanov |
| 1997 | Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension. | Michael Gavrilovich |
| 1997 | Learning Small Programs with Additional Information. | Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith |
| 1997 | Studying Algorithmic Problems for Free Semi-groups and Groups. | Valery Durnev |
| 1997 | The Concurrency Complexity for the Horn Fragment of Linear Logic. | Sergey M. Dudakov |
| 1997 | Recognition of Deductive Data Base Stability. | Michael I. Dekhtyar, Alexander Ja. Dikovsky |
| 1997 | Complexity of Query Answering in Logic Databases with Complex Values. | Evgeny Dantsin, Andrei Voronkov |
| 1997 | Finite Model Theory, Universal Algebra and Graph Grammars. | Bruno Courcelle |
| 1997 | A Safe Recursion Scheme for Exponential Time. | Peter Clote |
| 1997 | Towards Computing Distances Between Programs via Scott Domains. | Michael A. Bukatin, Joshua S. Scott |
| 1997 | Generic Queries over Quasy-o-minimal Domains. | Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin |
| 1997 | Domain-Free Pure Type Systems. | Gilles Barthe, Morten Heine Srensen |