Cantitate/Preț
Produs
Total produse
Vezi coșul
Logical Foundations of Computer Science: International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings de Sergei Artemov

Logical Foundations of Computer Science: International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings: Lecture Notes in Computer Science, cartea 11972

Editat de Sergei Artemov, Anil Nerode
en Limba Engleză Paperback – 14 dec 2019
This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 33302 lei  6-8 săpt.
  Springer – 25 mai 2007 33302 lei  6-8 săpt.
Paperback (1) 33058 lei  6-8 săpt.
  Springer – 18 dec 2008 33058 lei  6-8 săpt.
Paperback (1) 32771 lei  6-8 săpt.
  Springer – 21 noi 2012 32771 lei  6-8 săpt.
Paperback (1) 32561 lei  6-8 săpt.
  Springer International Publishing – 10 dec 2015 32561 lei  6-8 săpt.
Paperback (1) 32373 lei  6-8 săpt.
  Springer International Publishing – 28 noi 2017 32373 lei  6-8 săpt.
Paperback (1) 37360 lei  6-8 săpt.
  Springer International Publishing – 14 dec 2019 37360 lei  6-8 săpt.
Paperback (1) 46153 lei  3-5 săpt. +000 lei  6-12 zile
  Springer – 17 dec 2021 46153 lei  3-5 săpt. +000 lei  6-12 zile

Din seria Lecture Notes in Computer Science

Preț: 37360 lei

Puncte Express: 560
Preț estimativ în valută:
6612€ • 7727$ • 5740£

Carte tipărită la comandă

Livrare economică 20 februarie-06 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030367541
ISBN-10: 3030367541
Pagini: 350
Ilustrații: X, 287 p. 418 illus., 3 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.42 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Computability of Algebraic and Definable Closure.- Observable Models.- Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics.- Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory.- On the Constructive Truth and Falsity in Peano Arithmetic.- Belief Expansion in Subset Models.- Finitism, Concrete Programs and Primitive Recursion.- Knowledge of Uncertain Worlds: Programming with Logical Constraints.- A Globally Sound Analytic Calculus for Henkin Quantifiers.- Feedback Hyperjump.- Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents.- On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.- Parameterised Complexity of Abduction in Schaefer's Framework.- Tracking Computability of GPAC-Generable Functions.- Modal Type Theory Based on the Intuitionistic Modal Logic ������������!.- Lifting Recursive Counterexamples to Higher-Order Arithmetic.- On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction.

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.

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.

Caracteristici

Up to date results Fast track conference proceedings State of the art research