| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466079503316 |
|
|
Titolo |
Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1998.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 520 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1414 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Architecture, Computer |
Mathematical logic |
Computer logic |
Artificial Intelligence |
Computer System Implementation |
Mathematical Logic and Formal Languages |
Logics and Meanings of Programs |
Mathematical Logic and Foundations |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Call-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. |
|
|
|
|
|
|
Sommario/riassunto |
|
This 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. |
|
|
|
|
|
|
|
| |