Logical Foundations of Computer Science
Springer Berlin (Verlag)
978-3-540-72732-3 (ISBN)
Justified and Common Knowledge: Limited Conservativity.- The Intensional Lambda Calculus.- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers.- Elementary Differential Calculus on Discrete and Hybrid Structures.- Weighted Distributed Systems and Their Logics.- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!.- On Decidability and Expressiveness of Propositional Interval Neighborhood Logics.- Reasoning About Sequences of Memory States.- Cut Elimination in Deduction Modulo by Abstract Completion.- Density Elimination and Rational Completeness for First-Order Logics.- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus.- Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics.- A Decidable Temporal Logic of Repeating Values.- Model Checking Knowledge and Linear Time: PSPACE Cases.- Realizations and LP.- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking.- Explicit Proofs in Formal Provability Logic.- A Synthesis Algorithm for Hybrid Systems.- Including the Past in 'Topologic'.- A Note on Rewriting Proofs and Fibonacci Numbers.- On Complexity of Ehrenfeucht-Fraïssé Games.- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion.- Hypersequent Calculus for Intuitionistic Logic with Classical Atoms.- Proof Identity for Classical Logic: Generalizing to Normality.- On the Constructive Dedekind Reals: Extended Abstract.- Verifying Balanced Trees.- Compactness Properties for Stable Semantics of Logic Programs.- Uniform Circuits, & Boolean Proof Nets.- Finite Automata Presentable Abelian Groups.- Embeddings into Free Heyting Algebras and Translations into Intuitionistic PropositionalLogic.- Some Puzzles About Probability and Probabilistic Conditionals.- A Temporal Dynamic Logic for Verifying Hybrid System Invariants.- Multiplexor Categories and Models of Soft Linear Logic.- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms.- Total Public Announcements.
| Erscheint lt. Verlag | 25.5.2007 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XII, 516 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 152 x 229 mm |
| Gewicht | 739 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| Schlagworte | Automat • automated deduction • categorical semantics • Classical Logic • Complexity • Computational Logic • Computer • Computer Science • Computer Science Logic • Database • Decidability • Distributed Systems • Finite model theory • Game Theory • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Higher Order Logic • hybrid systems logic • interactive theorem proving • Linear Logic • Logic • Logical Foundations • Logic Programming • Mathematical Logic • Modal Logic • Model Checking • nonclassical logic • Program Logic • programming • Proof theory • Semantics • temporal logic • Term Rewriting • theorem proving • verification |
| ISBN-10 | 3-540-72732-9 / 3540727329 |
| ISBN-13 | 978-3-540-72732-3 / 9783540727323 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
