Logical Foundations of Computer Science
Editat de Sergei Artemov, Anil Nerodeen Limba Engleză Paperback – 17 dec 2021
The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized 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 logics; 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; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.
| Toate formatele și edițiile | 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ț: 461.85 lei
Preț vechi: 543.36 lei
-15% Nou
Puncte Express: 693
Preț estimativ în valută:
81.71€ • 95.34$ • 71.44£
81.71€ • 95.34$ • 71.44£
Carte disponibilă
Livrare economică 26 decembrie 25 - 09 ianuarie 26
Livrare express 12-18 decembrie pentru 38.44 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030930998
ISBN-10: 3030930998
Pagini: 388
Ilustrații: X, 377 p. 18 illus., 2 illus. in color.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.59 kg
Ediția:1st edition 2022
Editura: Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3030930998
Pagini: 388
Ilustrații: X, 377 p. 18 illus., 2 illus. in color.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.59 kg
Ediția:1st edition 2022
Editura: Springer
Locul publicării:Cham, Switzerland
Cuprins
A Non-Hyperarithmetical Gödel Logic.- Shorten Resolution Proofs Non-Elementarily.- The Isomorphism Problem for FST Injection Structures.- Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic.- Hyperarithmetical Worm Battles.- Parametric Church’s Thesis: Synthetic Computability Without Choice.- Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic.- A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance.- A Parameterized View on the Complexity of Dependence Logic.- A Logic of Interactive Proofs.- Recursive Rules With Aggregation: A Simple Unified Semantics.- Computational Properties of Partial Non-deterministic Matrices and Their Logics.- Soundness and Completeness Results for LEA and Probability Semantics.- On Inverse Operators in Dynamic Epistemic Logic.- Computability Models Over Categories and Presheaves.- Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability.- Between Turing and Kleene.- Propositional Dynamic Logic With Quantification Over Regular Computation Sequences.- Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic.- Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems.- Logical Principles.- Small Model Property Reflects in Games and Automata.
Caracteristici
Up to date results Fast track conference proceedings State of the art research
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.
Descriere
Descriere de la o altă ediție sau format:
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.
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.