Logical Foundations of Computer Science de Sergei Artemov

Logical Foundations of Computer Science

Sergei Artemov

Anil Nerode

en Limba Engleză Paperback – 25 mai 2007

Constitutes refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. This book addresses various aspects of logic in computer science. It includes topics such as constructive mathematics and type theory, and logical foundations of programming.

Citește tot Restrânge

	Preț	Express
Paperback (7)	323^.73 lei 6-8 săpt.	+28^.45 lei 7-13 zile
Springer – 17 dec 2021	461^.85 lei 3-5 săpt.	+28^.45 lei 7-13 zile
Springer International Publishing – 28 noi 2017	323^.73 lei 6-8 săpt.
Springer International Publishing – 10 dec 2015	325^.61 lei 6-8 săpt.
Springer – 21 noi 2012	327^.71 lei 6-8 săpt.
Springer – 18 dec 2008	330^.58 lei 6-8 săpt.
Springer – 25 mai 2007	333^.02 lei 6-8 săpt.
Springer International Publishing – 14 dec 2019	373^.60 lei 6-8 săpt.

Preț

Express

Paperback (7)

323^.73 lei 6-8 săpt.

+28^.45 lei 7-13 zile

Springer – 17 dec 2021

461^.85 lei 3-5 săpt.

+28^.45 lei 7-13 zile

Springer International Publishing – 28 noi 2017

323^.73 lei 6-8 săpt.

Springer International Publishing – 10 dec 2015

325^.61 lei 6-8 săpt.

Springer – 21 noi 2012

327^.71 lei 6-8 săpt.

Springer – 18 dec 2008

330^.58 lei 6-8 săpt.

Springer – 25 mai 2007

333^.02 lei 6-8 săpt.

Springer International Publishing – 14 dec 2019

373^.60 lei 6-8 săpt.

Cuprins

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.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.