Atjaunināt sīkdatņu piekrišanu

Proof Theory of Modal Logic Softcover reprint of hardcover 1st ed. 1996 [Mīkstie vāki]

  • Formāts: Paperback / softback, 318 pages, height x width: 235x155 mm, weight: 510 g, X, 318 p., 1 Paperback / softback
  • Sērija : Applied Logic Series 2
  • Izdošanas datums: 09-Dec-2010
  • Izdevniecība: Springer
  • ISBN-10: 9048147204
  • ISBN-13: 9789048147205
  • Mīkstie vāki
  • Cena: 176,32 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 207,44 €
  • 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, 318 pages, height x width: 235x155 mm, weight: 510 g, X, 318 p., 1 Paperback / softback
  • Sērija : Applied Logic Series 2
  • Izdošanas datums: 09-Dec-2010
  • Izdevniecība: Springer
  • ISBN-10: 9048147204
  • ISBN-13: 9789048147205
Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

Papildus informācija

Springer Book Archives
I Standard Proof Systems.- A Contraction-free Sequent Calculus for S4.- Transfer of Sequent Calculus Strategies to Resolution for S4.- A Linear Approach to Modal Proof Theory.- Refutations and Proofs in S4.- II Extended Formalisms.- Relational Proof Systems for Modal Logics.- The Display Problem.- Power and Weakness of the Modal Display Calculus.- A Proof-theoretic Proof of Functional Completeness for Many Modal and Tense Logics.- On the Completeness of Classical Modal Display Logic.- Modal Sequents.- Modal Functional Completeness.- A Computational Interpretation of Modal Proofs.- Gabbay-style Calculi.- III Translation-based Proof Systems.- Translating Graded Modalities into Predicate Logics.- From Classical to Normal Modal Logics.