1 option
Pillars of Computer Science : Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday / edited by Arnon Avron, Nachum Dershowitz, Alexander Rabinovich.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4800.
- Theoretical Computer Science and General Issues ; 4800
- Language:
- English
- Subjects (All):
- Computers.
- Logic, Symbolic and mathematical.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Artificial intelligence.
- Theory of Computation.
- Mathematical Logic and Formal Languages.
- Algorithm Analysis and Problem Complexity.
- Mathematics of Computing.
- Artificial Intelligence.
- Local Subjects:
- Theory of Computation.
- Mathematical Logic and Formal Languages.
- Algorithm Analysis and Problem Complexity.
- Mathematics of Computing.
- Artificial Intelligence.
- Algorithms.
- Physical Description:
- 1 online resource (XXI, 683 pages).
- Edition:
- First edition 2008.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
- System Details:
- text file PDF
- Contents:
- From 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-78127-1
- 9783540781271
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.