Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th LFCS 1997: Yaroslavl, Russia
- Sergei I. Adian, Anil Nerode:
Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings. Lecture Notes in Computer Science 1234, Springer 1997, ISBN 3-540-63045-7 - Sergei N. Artëmov, Jennifer M. Davoren, Anil Nerode:
Topological Semantics for Hybrid Systems. 1-8 - Gilles Barthe, Morten Heine Sørensen:
Domain-Free Pure Type Systems. 9-20 - Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Generic Queries over Quasy-o-minimal Domains. 21-32 - Michael A. Bukatin
, Joshua S. Scott:
Towards Computing Distances Between Programs via Scott Domains. 33-43 - Peter Clote:
A Safe Recursion Scheme for Exponential Time. 44-52 - Bruno Courcelle:
Finite Model Theory, Universal Algebra and Graph Grammars. 53-55 - Evgeny Dantsin, Andrei Voronkov:
Complexity of Query Answering in Logic Databases with Complex Values. 56-66 - Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability. 67-77 - Sergey M. Dudakov:
The Concurrency Complexity for the Horn Fragment of Linear Logic. 78-87 - Valery Durnev:
Studying Algorithmic Problems for Free Semi-groups and Groups. 88-101 - Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith:
Learning Small Programs with Additional Information. 102-112 - Michael Gavrilovich:
Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension. 113-118 - Mikhail Golovanov:
Finite Bases of Admissible Rules for the Logic S52C. 119-129 - Philippe de Groote:
An Algebraic Correctness Criterion for Intuitionistic Proof-Nets. 130-140 - David Harel:
Towards a Theory of Recursive Structures (extended abstract). 141-144 - Bernhard Heinemann:
On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces. 145-155 - Alexey P. Kopylov:
The Undecidability of Second Order Linear Affine Logic. 156-166 - Vladimir Krupski:
Operational Logic of Proofs with Functionality Condition on Proof Predicate. 167-177 - Alexei Lisitsa, Vladimir Yu. Sazonov:
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. 178-188 - G. S. Makanin, Habib Abdulrab, Pavel Goralcik:
Functions for the General Solution of Parametric Word Equations. 189-202 - Evgeny Makarov:
A Proof Procedure for Hereditary Harrop Formulas with Free Equality. 203-213 - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Basic Forward Chaining Construction for Logic Programs. 214-225 - Maurice Margenstern:
Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. 226-236 - Jean-Yves Marion:
Case Study: Additive Linear Logic and Lattices. 237-247 - Yuri V. Matiyasevich:
Some Decision Problems for Traces. 248-257 - Grigori Mints:
Existential Instantiation and Strong Normalization. 258-265 - Alexey Mkrtychev:
Models for the Logic of Proofs. 266-275 - Ulrich Nitsche:
Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences. 276-282 - Hitoshi Ohsaki, Aart Middeldorp:
Type Introduction for Equational Rewriting. 283-293 - Martin Otto:
Capturing Bisimulation-Invariant Ptime. 294-305 - Mati Pentus:
Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic. 306-311 - Guy Perrier:
A Decidable Fragment of Second Order Linear Logic. 312-322 - Igor Rents, Nikolay V. Shilov:
Some Results on Propositional Dynamic Logic with Fixed Points. 323-332 - Vladimir V. Rybakov:
Quasi-Characteristic Inference Rules for Modal Logics. 333-341 - Tatiana Sidon:
Provability Logic with Operations on Proofs. 342-353 - Robert F. Stärk:
Formal Verification of Logic Programs: Foundations and Implementation. 354-368 - Igor L. Tandetnik:
Unification of Terms with Term-Indexed Variables. 369-373 - Igor V. Tarasyuk:
Back-Forth Equivalences for Design of Concurrent Systems. 374-384 - Gregory S. Tseytin:
Association Nets: an Alternative Formalization of Common Thinking. 385-398 - Hongwei Xi:
Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculus. 399-409 - Rostislav E. Yavorsky:
Logical Schemes for First-Order Theories. 410-418 - Vladimir A. Zakharov:
Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms. 419-429
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
