000 04187nam a22005895i 4500
001 978-3-540-78127-1
003 DE-He213
005 20160624102117.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540781271
_9978-3-540-78127-1
024 7 _a10.1007/978-3-540-78127-1
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aPillars of Computer Science
_h[electronic resource] :
_bEssays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday /
_cedited by Arnon Avron, Nachum Dershowitz, Alexander Rabinovich.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _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,
_x0302-9743 ;
_v4800
505 0 _aFrom Logic to Theoretical Computer Science – An Update -- Reminiscences -- Boris A. Trakhtenbrot: Academic Genealogy and Publications -- Symmetric Logic of Proofs -- Synthesis of Monitors for Real-Time Analysis of Reactive Systems -- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms -- Effective Finite-Valued Approximations of General Propositional Logics -- Model Transformation Languages and Their Implementation by Bootstrapping Method -- Modal Fixed-Point Logic and Changing Models -- Fields, Meadows and Abstract Data Types -- Why Sets? -- The Church-Turing Thesis over Arbitrary Domains -- Generalized Categorial Dependency Grammars -- Temporal Verification of Probabilistic Multi-Agent Systems -- Linear Recurrence Relations for Graph Polynomials -- Artin’s Conjecture and Size of Finite Probabilistic Automata -- Introducing Reactive Kripke Semantics and Arc Accessibility -- On Partially Wellfounded Generic Ultrapowers -- Some Results on the Expressive Power and Complexity of LSCs -- Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories -- Tree Automata over Infinite Alphabets -- Connectives in Cumulative Logics -- Reasoning in Dynamic Logic about Program Termination -- The Grace of Quadratic Norms: Some Examples -- Nested Petri Nets for Adaptive Process Modeling -- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors -- Token-Free Petri Nets -- Proof Search Tree and Cut Elimination -- Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs -- Categories of Elementary Sets over Algebras and Categories of Elementary Algebraic Knowledge -- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey -- The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed -- The Reaction Algebra: A Formal Language for Event Correlation -- On Natural Non-dcpo Domains -- Church’s Problem and a Tour through Automata Theory -- From Monadic Logic to PSL.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMathematics of Computing.
650 2 4 _aComputing Methodologies.
650 2 4 _aAlgorithms.
700 1 _aAvron, Arnon.
_eeditor.
700 1 _aDershowitz, Nachum.
_eeditor.
700 1 _aRabinovich, Alexander.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540781264
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4800
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-78127-1
942 _2EBK8016
_cEBK
999 _c37310
_d37310