000 04504nam a22006255i 4500
001 978-3-540-69353-6
003 DE-He213
005 20240423132600.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540693536
_9978-3-540-69353-6
024 7 _a10.1007/BFb0028003
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aComputer Science Logic
_h[electronic resource] :
_b11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers /
_cedited by Mogens Nielsen, Wolfgang Thomas.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aVIII, 520 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1414
505 0 _aCall-by-value games -- LISA: A specification language based on WS2S -- Evolution as a computational engine -- Timeless games -- From action calculi to linear logic -- A sequent calculus for circumscription -- Linear lower bounds and simulations in frege systems with substitutions -- A formulation of linear logic based on dependency-relations -- Resolution and the weak pigeonhole principle -- Higher-order matching and tree automata -- A proof-theoretical investigation of Zantema's problem -- Spectra with only unary function symbols -- Classical proofs via basic logic -- Canonization for Lk-equivalence is Hard -- Full abstractness for a functional/concurrent language with higher-order value-passing -- A duality theory for quantitative semantics -- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion -- Equational axioms of test algebra -- Mona & Fido: The logic-automaton connection in practice -- Existence of reduction hierarchies -- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion -- A conjunctive logical characterization of nondeterministic linear time -- On the computational complexity of type 2 functionals -- Categories with algebraic structure -- Concurrent constraint programming and non-commutative logic -- A hierarchical approach to monadic second-order logic over graphs -- The monadic quantifier alternation hierarchy over grids and pictures -- Padding and the expressive power of existential second-order logics -- Rich ?-words and monadic second-order arithmetic -- A simple ordinal recursive normalization of Gödel's T.
520 _aThis book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state of the art in the area.
650 0 _aArtificial intelligence.
650 0 _aComputer systems.
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aMathematical logic.
650 1 4 _aArtificial Intelligence.
650 2 4 _aComputer System Implementation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aNielsen, Mogens.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aThomas, Wolfgang.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540645702
776 0 8 _iPrinted edition:
_z9783662205716
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1414
856 4 0 _uhttps://doi.org/10.1007/BFb0028003
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189374
_d189374