default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd LFCS 1992: Tver, Russia
- Anil Nerode, Michael A. Taitslin:
Logical Foundations of Computer Science - Tver '92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings. Lecture Notes in Computer Science 620, Springer 1992, ISBN 3-540-55707-5 - Dmitry A. Archangelsky, Mikhail A. Taitslin:
Modular Linear Logic. 1-8 - Ganesh Baliga
, John Case, Sanjay Jain, Mandayam Suraj:
Machine Learning of Higher Order Programs. 9-20 - Richard Beigel, Martin Kummer, Frank Stephan:
Quantifying the Amount of Verboseness. 21-32 - P. N. Benton:
Strictness Logic and Polymorphic Invariance. 33-44 - Allen L. Brown Jr., Surya Mantha, Toshiro Wakayama:
Preference Logics and Non-Monotonicity in Logic Programming. 45-56 - A. Calò, Johann A. Makowsky:
The Ehrenfeucht-Fraisse Games for Transitive Closure. 57-68 - Karlis Cerans:
Feasibility of Finite and Infinite Paths in Data Dependent Programs. 69-80 - Liang Chen:
An Interleaving Model for Real-Time Systems. 81-92 - Søren Christensen:
A Logical Characterization of Asynchronously Communicating Agents. 93-104 - Philippe de Groote:
Denotations for Classical Proofs - Preliminary Results. 105-116 - Nachum Dershowitz, Edward M. Reingold:
Ordinal Arithmetic with List Structures. 117-126 - Abbas Edalat:
Continuous I-Categories. LFCS 1992: 127-138 - Melvin Fitting:
Many-Valued Non-Monotonic Modal Logics. 139-150 - Didier Galmiche, Guy Perrier:
Automated Deduction in Additive and Multiplicative Linear Logic. 151-162 - B. Gamatie:
Intensionally Stable Functions. 163-173 - Arvind Gupta:
A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. 174-185 - Lane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin:
Banishing Robust Turing Completeness. 186-197 - Sachio Hirokawa:
Balanced Formulas, BCK-Minimal Formulas and Their Proofs. 198-208 - Raymond Hoofman:
Non-Stable Models of Linear Logic. 209-220 - Andy King, Paul Soper:
Ordering Optimizations for Concurrent Logic Programs. 221-228 - Peter M. W. Knijnenburg, Frank Nordemann:
A Categorical Interpretation of Partial Function Logic and Hoare Logic. 229-240 - Nikolai K. Kossovsky, A. B. Prokhoroff:
The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited. 241-245 - Sergey V. Kotov:
Typed lamda-Calculus with Recursive Definitions. 246-257 - Kevin Lano:
Set Theoretic Foundations for Fuzzy Set Theory, and Their Applications. 258-268 - Frank Leßke:
Constructive Specifications of Abstract Data Types Using Temporal Logic. 269-280 - Renwei Li, José Carmo:
An Interval-Based Modal Logic for System Specification. 281-292 - Zhaohui Luo:
A Unifying Theory of Dependent Types: The Schematic Approach. 293-304 - V. P. Makarov:
MSL - A Mathematical Specification Language. 305-313 - Aristide Mégrelis:
Partial Algebra + Order-Sorted Algebra = Galactic Algebra. 314-325 - Alberto Momigliano:
Minimal Negation and Hereditary Harrop Formulae. 326-335 - John Mullins:
Kleene Automata and Recursion Theory. 336-346 - Alan Mycroft:
Incremental Polymorphic Type Checking with Update. 347-357 - Jan A. Plaza:
Operators on Lattices of omega-Herbrand Interpretations. 358-369 - Aida Pliuskeviciene:
Sequential Calculus for Proving the Properties of Regular Programs. 370-381 - Regimantas Pliuskevicius:
Complete Sequential Calculi for the First Order Symmetrical Linear Temporal Logic with Until and Since. 382-393 - Alexander Moshe Rabinovich:
Non Modularity and Expressibility for Nets of Relations. 394-405 - Wolfgang Reif:
Correctness of Generic Modules. 406-417 - Kamel Sadi, François Meunier:
An And-Parallelism Cooperative Scheme for Full Prolog Interpreters on a Transputer-Based Architecture. 418-429 - Jurate Sakalauskaite:
A Sequent Calculus for a First Order Linear Temporal Logic with Equality. 430-440 - Bernd-Holger Schlingloff:
On the Expressive Power of Modal Logics on Trees. 441-451 - Nikolay V. Shilov:
Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State Machines. 452-458 - Dieter Spreen:
Effective Operators and Continuity Revisited. 459-469 - Iain A. Stewart:
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. 470-479 - Jerzy Tiuryn:
Solving Equational Constraints in Polymorphic Types. 480-492 - Sergei Tupailo:
Gentzen-Style and Novikov-Style Cut-Elimination. 493-502 - Wiebe van der Hoek, John-Jules Ch. Meyer:
Graded Modalities in Epistemic Logic. 503-514
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-10-18 19:35 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:
