MARC Record from marc_columbia

LEADER: 06092cam a22003734a 4500
001 4173029
005 20221027045603.0
008 030731s2003 nyu 100 0 eng
010 $a 2003059118
016 7 $a968515436$2GyFmDB
020 $a3540408010 (softcover : alk. paper)
035 $a(OCoLC)ocm52813762
035 $a(NNC)4173029
035 $a4173029
040 $aDLC$cDLC$dOHX$dOrLoB-B
042 $apcc
050 00 $aQA76.9.L63$bC68 2003
072 7 $aQA$2lcco
082 00 $a005.1/01/5113$222
245 00 $aComputer science logic :$b17th international workshop, CSL 2003, 12th annual conference of the EACSL, and the 8th Kurt Gödel Colloquium, KGC 2003 : proceedings /$cMatthias Baaz, Johann A. Makowsky (eds.).
260 $aNew York :$bSpringer,$c2003.
300 $axii, 590 pages :$billustrations ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aLecture notes in computer science ;$v2803
505 00 $tDeciding Monotonic Games /$rParosh Aziz Abdulla, Ahmed Bouajjani and Julien d'Orso -- $tThe Commuting V-Diagram /$rBernhard K. Aichernig -- $tConcurrent Construction of Proof-Nets /$rJean-Marc Andreoli and Laurent Mazare -- $tBack to the Future: Explicit Logic for Computer Science /$rSergei Artemov -- $tConstraint Satisfaction with Countable Homogeneous Templates /$rManuel Badirsky and Jaroslav Nesetril -- $tQuantified Constraints: Algorithms and Complexity /$rFerdinand Borner, Andrei Bulatov, Peter Jeavons and Andrei Krokhin -- $tVerification of Infinite State Systems (Tutorial) /$rAhmed Bouajjani -- $tParity of Imperfection or Fixing Independence /$rJulian C. Bradfield -- $tAtomic Cut Elimination for Classical Logic /$rKai Brunnler -- $tComputational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture) /$rBruno Buchberger -- $tSimple Stochastic Parity Games /$rKrishnendu Chatterjee, Marcin Jurdzinski and Thomas A. Henzinger -- $tMachine Characterizations of the Classes of the W-Hierarchy /$rYijia Chen and Jorg Flum -- $tExtending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions /$rYannick Chevalier, Ralf Kusters, Michael Rusinowitch, Mathieu Turuani and Laurent Vigneron -- $tOn Relativisation and Complexity Gap for Resolution-Based Proof Systems /$rStefan Dantchev and Soren Riis -- $tStrong Normalization of the Typed [lambda][subscript ws]-Calculus /$rRene David and Bruno Guillaume -- $tA Fixed-Point Logic with Symmetric Choice /$rAnuj Dawar and David Richerby -- $tPositive Games and Persistent Strategies /$rJacques Duparc -- $tGenerating All Abductive Explanations for Queries on Propositional Horn Theories /$rThomas Eiter and Kazuhisa Makino -- $tRefined Complexity Analysis of Cut Elimination /$rPhilipp Gerhardy -- $tComparing the Succinetness of Monadic Query Languages over Finite Trees /$rMartin Grohe and Nicole Schweikardt -- $tThe Arithmetical Complexity of Dimension and Randomness /$rJohn M. Hitchcock, Jack H. Lutz and Sebastiaan A. Terwijn -- $tTowards a Proof System for Admissibility /$rRosalie Iemhoff -- $tProgram Complexity of Dynamic LTL Model Checking /$rDetlef Kahler and Thomas Wilke -- $tCoping Polynomially with Numerous but Identical Elements within Planning Problems /$rMax Kanovich and Jacqueline Vauzeilles -- $tOn Algebraic Specifications of Abstract Data Types /$rBakhadyr Khoussainov -- $tOn the Complexity of Existential Pebble Games /$rPhokion G. Kolaitis and Jonathan Panttaja -- $tComputational Aspects of [Sigma]-Definability over the Real Numbers without the Equality Test /$rMargarita Korovina -- $tThe Surprising Power of Restricted Programs and Godel's Functionals /$rLars Kristiansen and Paul J. Voda -- $tPebble Games on Trees /$rLukasz Krzeszezakowski -- $tBistability: An Extensional Characterization of Sequentiality /$rJames Laird -- $tAutomata on Lempel-Ziv Compressed Strings /$rHans Leiss and Michel de Rougemont -- $tComplexity of Some Problems in Modal and Intuitionistic Calculi /$rLarisa Maksimova and Andrei Voronkov -- $tGoal-Directed Calculi for Godel-Dummett Logics /$rGeorge Metcalfe, Nicola Olivetti and Dov Gabbay -- $tA Logic for Probability in Quantum Systems /$rRon van der Meyden and Manas Patra -- $tA Strongly Normalising Curry-Howard Correspondence for IZF Set Theory /$rAlexandre Miquel -- $tThe Epsilon Calculus (Tutorial) /$rGeorg Moser and Richard Zach -- $tModular Semantics and Logics of Classes /$rBernhard Reus -- $tValidity of CTL Queries Revisited /$rMarko Samer and Helmut Veith -- $tCalculi of Meta-variables /$rMasahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama and Atsushi Igarashi -- $tHenkin Models of the Partial [lambda]-Calculus /$rLutz Schroder -- $tNominal Unification /$rChristian Urban, Andrew Pitts and Murdoch Gabbay -- $tFriends or Foes? Communities in Software Verification /$rHelmut Veith -- $tMore Computation Power for a Denotational Semantics for First Order Logic /$rKess F. M. Vermeulen -- $tEffective Model Completeness of the Theory of Restricted Pfaffian Functions /$rNicolai Vorobjor -- $tEffective Quantifier Elimination over Real Closed Fields (Tutorial) /$rNicolai Vorobjor -- $tFast Infinite-State Model Checking in Integer-Based Systems /$rTationa Rybnia and Andrea Voronkov -- $tWinning Strategies and Synthesis of Controllers (Tutorial) /$rIgor Walukivwicz -- $tLogical Relations for Dynamic Name Creation /$rYu Zhang and David Nowak.
650 0 $aComputer logic$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2009121216
700 1 $aBaaz, Matthias.$0http://id.loc.gov/authorities/names/n2002161044
700 1 $aMakowsky, Johann A.,$d1948-$0http://id.loc.gov/authorities/names/n97124747
711 2 $aCSL 2003$d(2003 :$cVienna University of Technology)
710 2 $aEuropean Association for Computer Science Logic.$bConference$n(12th :$d2003 :$cVienna University of Technology)
711 2 $aKurt Gödel Colloquium$n(8th :$d2003 :$cVienna University of Technology)
830 0 $aLecture notes in computer science ;$v2803.$0http://id.loc.gov/authorities/names/n42015162
852 00 $boff,eng$hQA76.9.L63$iC68 2003