Computer science logic. 12th international workshop, CSL '98, annual conference of the EACSL, Brno, Czech Republic, August 24--28, 1998. Proceedings (Q1287618)

The articles of this volume will be reviewed individually. The preceding workshop (11th, 1997) has been announced (see Zbl 0891.00021). Indexed articles: \textit{Hájek, Petr}, Trakhtenbrot theorem and fuzzy logic, 1-8 [Zbl 0943.03021] \textit{Schwentick, Thomas}, Descriptive complexity, lower bounds and linear time, 9-28 [Zbl 0934.03054] \textit{Egly, Uwe}, Quantifiers and the system KE: Some surprising results, 90-104 [Zbl 0947.03012] \textit{Hoang, H. K.}, Choice construct and Lindström logics, 105-125 [Zbl 0933.03037] \textit{Kreidler, Martin; Seese, Detlef}, Monadic NP and graph minors, 126-141 [Zbl 0933.03038] \textit{Makowsky, J. A.}, Invariant definability and P/poly, 142-158 [Zbl 0934.03053] \textit{Pezzoli, Elena}, Computational complexity of Ehrenfeucht-Fraïssé games on finite structures, 159-170 [Zbl 0934.03048] \textit{Kleine Büning, Hans}, An upper bound for minimal resolution refutations, 171-178 [Zbl 0934.03015] \textit{Sadowski, Zenon}, On an optimal deterministic algorithm for SAT, 179-187 [Zbl 0934.03055] \textit{Korovina, M. V.; Kudinov, O. V.}, Characteristic properties of majorant-computability over the reals, 188-203 [Zbl 0934.03056] \textit{Riche, Jacques; Meyer, Robert K.}, Kripke, Belnap, Urquhart and relevant decidability \(\&\) complexity. ``Das ist nicht Mathematik. Das ist Theologie'', 224-240 [Zbl 0939.03026] \textit{Barthe, Gilles}, Existence and uniqueness of normal forms in pure type systems with \(\beta\eta\)-conversion, 241-259 [Zbl 0933.03008] \textit{Khasidashvili, Zurab; Piperno, Adolfo}, Normalization of typable terms by superdevelopments, 260-282 [Zbl 0933.03010] \textit{Vorobyov, Sergei}, Subtyping functional + nonempty record types, 283-297 [Zbl 0940.68081] \textit{Matthes, Ralph}, Monotone fixed-point types and strong normalization, 298-312 [Zbl 0933.03027] \textit{Statman, Rick}, Morphisms and partitions of \(V\)-sets, 313-322 [Zbl 0934.03020] \textit{Simpson, Alex K.}, Computational adequacy in an elementary topos, 323-342 [Zbl 0933.03031] \textit{Altenkirch, Thorsten}, Logical relations and inductive/coinductive types, 343-354 [Zbl 0934.03019] \textit{Pichler, Reinhard}, On the complexity of \(H\)-subsumption, 355-371 [Zbl 0934.03017] \textit{Bonfante, G.; Cichon, A.; Marion, J. Y.; Touzet, H.}, Complexity classes and rewrite systems with polynomial interpretation, 372-384 [Zbl 0934.03052] \textit{Narendran, Paliath; Rusinowitch, Michael; Verma, Rakesh}, RPO constraint solving is in NP, 385-398 [Zbl 0940.68070] \textit{Baaz, Matthias; Veith, Helmut}, Quantifier elimination in fuzzy logic, 399-414 [Zbl 0933.03022] \textit{Lukasiewicz, Thomas}, Many-valued first-order logics with probabilistic semantics, 415-429 [Zbl 0947.03032]