Logical foundations of computer science. Tver '92, 2nd international symposium, Tver, Russia, July 20-24, 1992. Proceedings (Q1592477)

The articles of mathematical interest will be reviewed individually. The 3rd symposium 1994 has been reviewed (see Zbl 0865.00034). Indexed articles: \textit{Archangelsky, D. A.; Taitslin, M. A.}, Modal linear logic, 1-8 [Zbl 0978.03516] \textit{Baliga, G.; Case, J.; Jain, S.; Suraj, M.}, Machine learning of higher order programs, 9-20 [Zbl 0978.03530] \textit{Beigel, R.; Kummer, M.; Stephan, F.}, Quantifying the amount of verboseness (extended abstract), 21-32 [Zbl 0978.03527] \textit{Benton, P. N.}, Strictness logic and polymorphic invariance, 33-44 [Zbl 0978.03508] \textit{Brown, A. L. jun.; Mantha, S.; Wakayama, T.}, Preference logics and nonmonotonicity in logic programming, 45-56 [Zbl 0977.68511] \textit{Calò, A.; Makowsky, J. A.}, The Ehrenfeucht-Fraïssé games for transitive closure, 57-68 [Zbl 0978.03525] \textit{Čerāns, Kārlis}, Feasibility of finite and infinite paths in data dependent programs, 69-80 [Zbl 0977.68527] \textit{Chen, Liang}, An interleaving model for real-time systems, 81-92 [Zbl 0977.68553] \textit{Christensen, Søren}, A logical characterization of asynchronously communicating agents, 93-104 [Zbl 0977.68554] \textit{de Groote, P.}, Denotations for classical proofs -- preliminary results, 105-116 [Zbl 0978.03509] \textit{Dershowitz, N.; Reingold, E. M.}, Ordinal arithmetic with list structures, 117-126 [Zbl 0977.68530] \textit{Edalat, A.}, Continuous I-categories (extended abstract), 127-138 [Zbl 0977.18500] \textit{Fitting, M.}, Many-valued non-monotonic modal logics, 139-150 [Zbl 0978.03518] \textit{Galmiche, D.; Perrier, G.}, Automated deduction in additive and multiplicative linear logic, 151-162 [Zbl 0978.03507] \textit{Gamatie, B.}, Intensionally stable functions, 163-173 [Zbl 0978.03510] \textit{Gupta, Arvind}, A constructive proof that trees are well-quasi-ordered under minors (detailed abstract), 174-185 [Zbl 0977.05500] \textit{Hemachandra, L. A.; Jain, S.; Vereshchagin, N. K.}, Banishing robust Turing completeness, 186-197 [Zbl 0977.68542] \textit{Hirokawa, Sachio}, Balanced formulas, BCK-minimal formulas and their proofs, 198-208 [Zbl 0978.03517] \textit{Hoofman, R.}, Non-stable models of linear logic, 209-220 [Zbl 0978.03535] \textit{King, Andy; Soper, Paul}, Ordering optimizations for concurrent logic programs, 221-228 [Zbl 0977.68512] \textit{Knijnenburg, P. M. W.; Nordemann, F.}, A categorical interpretation of partial function logic and Hoare logic, 229-240 [Zbl 0978.03519] \textit{Kossovsky, N. K.; Prokhoroff, A. B.}, The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited, 241-245 [Zbl 0978.03528] \textit{Kotov, Sergey V.}, Typed \(\lambda\)-calculus with recursive definitions, 246-257 [Zbl 0978.03511] \textit{Lano, K.}, Set theoretic foundations for fuzzy set theory, and their applications, 258-268 [Zbl 0978.03533] \textit{Lesske, Frank}, Constructive specifications of abstract data types using temporal logic, 269-280 [Zbl 0977.68552] \textit{Li, Renwei; Carmo, José}, An interval-based modal logic for system specification, 281-292 [Zbl 0978.03520] \textit{Luo, Zhaohui}, A unifying theory of dependent types: The schematic approach, 293-304 [Zbl 0978.03521] \textit{Makarov, V. P.}, MSL -- a mathematical specification language, 305-313 [Zbl 0977.68528] \textit{Mégrelis, Aristide}, Partial algebra + order-sorted algebra = galactic algebra, 314-325 [Zbl 0978.08501] \textit{Momigliano, Alberto}, Minimal negation and hereditary Harrop formulae, 326-335 [Zbl 0977.68513] \textit{Mullins, John}, Kleene automata and recursion theory, 336-346 [Zbl 0978.03526] \textit{Mycroft, Alan}, Incremental polymorphic type checking with update, 347-357 [Zbl 0977.68529] \textit{Plaza, J. A.}, Operators on lattices of \(\omega\)-Herbrand interpretations (extended abstract), 358-369 [Zbl 0977.68514] \textit{Pliuškevičienė, Aida}, Sequential calculus for proving the properties of regular programs, 370-381 [Zbl 0978.03522] \textit{Pliuškevičius, Regimantas}, Complete sequential calculi for the first order symmetrical linear temporal logic with until and since, 382-393 [Zbl 0978.03513] \textit{Rabinovich, Alexander}, Non modularity and expressibility for nets of relations (extended abstract), 394-405 [Zbl 0977.68555] \textit{Reif, Wolfgang}, Correctness of generic modules, 406-417 [Zbl 0977.68551] \textit{Sadi, K.; Meunier, F.}, An and-parallelism cooperative scheme for full Prolog interpreters on a transputer-based architecture, 418-429 [Zbl 0977.68515] \textit{Sakalauskaitė, Jūratė}, A sequent calculus for a first order linear temporal logic with equality, 430-440 [Zbl 0978.03514] \textit{Schlingloff, Bernd-Holger}, On the expressive power of modal logics on trees (extended abstract), 441-451 [Zbl 0978.03523] \textit{Shilov, N. V.}, Propositional dynamic logic with fixed points: algorithmic tools for verification of finite state machines, 452-458 [Zbl 0978.03524] \textit{Spreen, Dieter}, Effective operators and continuity revisited, 459-469 [Zbl 0977.68549] \textit{Stewart, Iain A.}, Logical characterizations of bounded query classes. I: Logspace oracle machines, 470-479 [Zbl 0978.03529] \textit{Tiuryn, Jerzy}, Solving equational constraints in polymorphic types, 480-492 [Zbl 0978.03512] \textit{Tupailo, S.}, Gentzen-style and Novikov-style cut-elimination, 493-502 [Zbl 0978.03534] \textit{van der Hoek, W.; Meyer, J.-J. Ch.}, Graded modalities in epistemic logic, 503-514 [Zbl 0978.03515]