Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND Volume=1234
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Existential instantiation and strong normalization
G. Mints
Lecture Notes in Computer Science
1234
, 1997, pp. 258-265
Models for the logic of proofs
Alexey Mkrtychev
Lecture Notes in Computer Science
1234
, 1997, pp. 266-275
Interpretation of the full computation tree logic CTL* on sets of infinite sequences
Ulrich Nitsche
Lecture Notes in Computer Science
1234
, 1997, pp. 276-282
Type introduction for equational rewriting
Hitoshi Ohsaki
,
Aart Middeldorp
Lecture Notes in Computer Science
1234
, 1997, pp. 283-293
Capturing bisimulation-invariant Ptime
Martin Otto
Lecture Notes in Computer Science
1234
, 1997, pp. 294-305
Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic
Mati Pentus
Lecture Notes in Computer Science
1234
, 1997, pp. 306-311
A decidable fragment of second order linear logic
G. Perrier
Lecture Notes in Computer Science
1234
, 1997, pp. 312-322
Some results on propositional dynamic logic with fixed points
Igor Rents
,
Nikolaj Shilov
Lecture Notes in Computer Science
1234
, 1997, pp. 323-332
Quasi-characteristic inference rules for modal logics
Vladimir V. Rybakov
Lecture Notes in Computer Science
1234
, 1997, pp. 333-341
Provability logic with operations on proofs
Tatiana Sidon
Lecture Notes in Computer Science
1234
, 1997, pp. 342-353
Formal verification of logic programs: Foundations and implementation
Robert F. Stärk
Lecture Notes in Computer Science
1234
, 1997, pp. 354-368
Unification of terms with term-indexed variables
Igor L. Tandetnik
Lecture Notes in Computer Science
1234
, 1997, pp. 369-373
Back-forth equivalences for design of concurrent systems
Igor V. Tarasyuk
Lecture Notes in Computer Science
1234
, 1997, pp. 374-384
Association nets: An alternative formalization of common thinking
G.S. Tseytin
Lecture Notes in Computer Science
1234
, 1997, pp. 385-398
Simulating
\eta
-expansions with
\beta
-reductions in the second-order polymorphic
\lambda
-calculus
Hongwei Xi
Lecture Notes in Computer Science
1234
, 1997, pp. 399-409
Logical schemes for first order theories
Rostislav E. Yavorsky
Lecture Notes in Computer Science
1234
, 1997, pp. 410-418
Verification of PLTL formulae by means of monotone disjunctive normal forms
Vladimir Zakharov
Lecture Notes in Computer Science
1234
, 1997, pp. 419-429
Seiten
<
1
2