Atjaunināt sīkdatņu piekrišanu

Logical Foundations of Computer Science: International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings 2013 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 415 pages, height x width: 235x155 mm, weight: 652 g, 49 Illustrations, black and white; X, 415 p. 49 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 7734
  • Izdošanas datums: 21-Nov-2012
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642357210
  • ISBN-13: 9783642357213
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 415 pages, height x width: 235x155 mm, weight: 652 g, 49 Illustrations, black and white; X, 415 p. 49 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 7734
  • Izdošanas datums: 21-Nov-2012
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642357210
  • ISBN-13: 9783642357213
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.
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.