Logical Foundations of Computer Science [electronic resource] : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007. Proceedings / edited by Sergei N. Artemov, Anil Nerode.
Material type: TextSeries: Lecture Notes in Computer Science ; 4514Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XII, 516 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540727347Subject(s): Computer science | Logic design | Logic, Symbolic and mathematical | Computer Science | Mathematical Logic and Formal Languages | Logics and Meanings of Programs | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK7596 |
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 Propositional Logic -- 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.
There are no comments on this title.