LFCS '94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings (Q1327712)

From MaRDI portal
Revision as of 02:57, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
LFCS '94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings
scientific article

    Statements

    LFCS '94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings (English)
    0 references
    28 June 1994
    0 references
    The articles of this volume will be reviewed individually. See also the announcement of the 4th symposium (1997) in Zbl 0865.00034. Indexed articles: \textit{Ablayev, Farid}, Lower bounds for probabilistic space complexity: Communication-automata approach, 1-7 [Zbl 0969.68515] \textit{Andersen, Henrik Reif}, On model checking infinite-state systems, 8-17 [Zbl 0964.03526] \textit{Archangelsky, Dmitry A.; Dekhtyar, Mikhail I.; Kruglov, Evgeny; Musikaev, Ilmir Kh.; Taitslin, Mikhail A.}, Concurrency problem for Horn fragment of Girard's linear logic, 18-22 [Zbl 0964.03524] \textit{Artemov, Sergei; Krupski, Vladimir}, Referential data structures and labeled modal logic, 23-33 [Zbl 0964.03527] \textit{Asperti, Andrea; Dore, Giovanna}, Yet another correctness criterion for multiplicative linear logic with MIX, 34-46 [Zbl 0964.03533] \textit{Berezin, S. A.; Shilov, Nikolay V.}, An approach to effective model-checking of real-time finite-state machines in mu-calculus, 47-55 [Zbl 0964.03529] \textit{Brown, Carolyn; Jeffrey, Alan}, Allegories of circuits, 56-68 [Zbl 0964.94505] \textit{Chen, Cheng-Chia; Lin, I-Peng}, The complexity of propositional modal theories and the complexity of consistency of propositional modal theories, 69-80 [Zbl 0946.03021] \textit{Dekhtyar, Alexander M.}, Multiplicative linear logic for resource transformation nets, 81-88 [Zbl 0964.03525] \textit{Downey, Rodney G.; Fellows, Michael R.; Kapron, Bruce M.; Hallett, Michael T.; Wareham, H. Todd}, The parameterized complexity of some problems in logic and linguistics, 89-100 [Zbl 0946.03046] \textit{Galmiche, D.; Perrier, G.}, Foundations of proof search strategies design in linear logic, 101-113 [Zbl 0964.03512] \textit{Ge, Xiaolin; Nerode, Anil}, On extreme points of convex compact Turing located set, 114-128 [Zbl 0947.03079] \textit{Ghilezan, Silvia}, Application of typed lambda calculi in the untyped lambda calculus, 129-139 [Zbl 0947.03021] \textit{Goncharov, S. S.; Badaev, S. A.}, Classes with pairwise equivalent enumerations, 140-141 [Zbl 0969.03513] \textit{de Groote, Philippe}, Strong normalization in a non-deterministic typed lambda-calculus, 142-152 [Zbl 0947.03020] \textit{Heinemann, Bernhard}, On expressive completeness of modal logic, 153-163 [Zbl 0946.03022] \textit{Hoofman, R.}, Comparing models of the non-extensional typed lambda-calculus, 164-172 [Zbl 0946.03017] \textit{Jacobs, Bart}, Coalgebras and approximation, 173-183 [Zbl 0947.03082] \textit{Kanovich, Max I.}, Computational and concurrency models of linear logic, 184-190 [Zbl 0969.03517] \textit{Khasidashvili, Zurab}, The longest perpetual reductions in orthogonal expression reduction systems, 191-203 [Zbl 0964.03528] \textit{Khoussainov, Bakhadyr; Nerode, Anil}, The notion of rank and games, 204-217 [Zbl 0946.03013] \textit{Kuchuganov, Mikle}, A predicate logic of well-founded actions, 218-226 [Zbl 0947.03047] \textit{Leivant, Daniel}, Predicative recurrence in finite types, 227-239 [Zbl 0947.03065] \textit{Makowsky, J. A.; Pnueli, Y. B.}, Arity vs. alternation in second order logic, 240-252 [Zbl 0946.03041] \textit{Nickau, Hanno}, Hereditarily sequential functionals, 253-264 [Zbl 0946.03053] \textit{Nitsche, Ulrich}, Propositional linear temporal logic and language homomorphisms, 265-277 [Zbl 0946.03020] \textit{Pino Pérez, Ramón; Even, Christian}, An abstract property of confluence applied to the study of the lazy partial lambda calculus, 278-290 [Zbl 0964.03514] \textit{Pliuškevičienė, A.; Pliuškevičius, R.}, On specialization of derivations in axiomatic equality theories, 291-303 [Zbl 0947.03074] \textit{Rybakov, Vladimir V.}, Preserving of admissible inference rules in modal logic, 304-315 [Zbl 0947.03025] \textit{Severi, Paula; Poll, Erik}, Pure type systems with definitions, 316-328 [Zbl 0964.03513] \textit{Sidon, Tatiana}, Craig interpolation property in modal logics with provability interpretation, 329-340 [Zbl 0946.03023] \textit{Traylor, Bonnie; Gelfond, Michael}, Representing null values in logic programming, 341-352 [Zbl 0969.68506] \textit{van Bakel, Steffen; Liquori, Luigi; Ronchi della Rocca, Simona; Urzyczyn, Paweł}, Comparing cubes, 353-365 [Zbl 0947.03022] \textit{van der Hoek, W.; van Linder, B.; Meyer, J.-J. Ch.}, A logic of capabilities, 366-378 [Zbl 0964.03520] \textit{van Oostrom, Vincent; van Raamsdonk, Femke}, Weak orthogonality implies confluence: The higher-order case, 379-392 [Zbl 0964.68523]
    0 references
    St. Petersburg (Russia)
    0 references
    Symposium
    0 references
    Proceedings
    0 references
    LFCS '94
    0 references
    Computer Science
    0 references
    Logical foundations
    0 references

    Identifiers