Mathematical foundations of computer science 1996. 21st international symposium, MFCS '96, Cracow, Poland, September 2--6, 1996. Proceedings
type: Item
instance of: scholarly article
title: Mathematical foundations of computer science 1996. 21st international symposium, MFCS '96, Cracow, Poland, September 2--6, 1996. Proceedings
zbMATH Open document ID: 0852.00041
published in: Lecture Notes in Computer Science
publication date: 1996-08-21T00:00:00Z
review text: The articles of this volume will be reviewed individually. The preceding conference (20, 1995) has been reviewed (see Zbl 0847.00052). Indexed articles: \textit{Diekert, Volker; Muscholl, Anca}, Code problems on traces, 2-17 [Zbl 0889.68092] \textit{Mukund, Madhavan; Thiagarajan, P. S.}, Linear time temporal logics over Mazurkiewicz traces, 62-92 [Zbl 0886.03017] \textit{Tiuryn, Jerzy}, A sequent calculus for subtyping polymorphic types, 135-155 [Zbl 0886.03011] \textit{Balbiani, Philippe}, A modal logic for data analysis, 167-179 [Zbl 0886.03015] \textit{Bednarczyk, Marek A.}, Logic of predicates with explicit substitutions, 195-205 [Zbl 0886.03006] \textit{Beigel, Richard; Gasarch, William; Kummer, Martin; Martin, Georgia; McNicholl, Timothy; Stephan, Frank}, On the query complexity of sets, 206-217 [Zbl 0886.03034] \textit{Bono, Viviana; Bugliesi, Michele; Liquori, Luigi}, A lambda calculus of incomplete objects, 218-229 [Zbl 0896.03016] \textit{Cai, X.; Kloks, T.; Wong, C. K.}, Shortest path problems with time constraints, 255-266 [Zbl 0886.05105] \textit{Demri, Stéphane}, A class of information logics with a decidable validity problem, 291-302 [Zbl 0886.03014] \textit{Durand, Bruno}, Self-similarity viewed as a local property via tile sets, 312-335 [Zbl 0886.05045] \textit{Ésik, Zoltán; Labella, Anna}, Equational properties of iteration in algebraically complete categories, 336-347 [Zbl 0885.18002] \textit{Fernau, Henning}, On unconditional transfer, 348-359 [Zbl 0889.68095] \textit{Fotakis, Dimitris; Spirakis, Paul}, \((\text{poly}(\log\log n),\text{poly}(\log\log n))\)-restricted verifiers are unlikely to exist for languages in \({\mathcal NP}\), 360-371 [Zbl 0889.68059] \textit{Glaister, Ian; Shallit, Jeffrey}, Polynomial automaticity, context-free languages, and fixed points of morphisms. (Extended abstract), 382-393 [Zbl 0889.68093] \textit{Goltz, Ursula; Wehrheim, Heike}, Causal testing, 394-406 [Zbl 1499.68224] \textit{Mantaci, Sabrina; Restivo, Antonio}…
Mathematics Subject Classification ID: 00B25
Mathematics Subject Classification ID: 68-06
zbMATH DE Number: 918612
zbMATH Keywords: Computer science
zbMATH Keywords: Mathematical foundations
zbMATH Keywords: Symposium
zbMATH Keywords: Proceedings
zbMATH Keywords: Cracow (Poland)
zbMATH Keywords: Kraków (Poland)
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 918612