Atjaunināt sīkdatņu piekrišanu

Logic for Applications 2nd ed. 1997 [Hardback]

  • Formāts: Hardback, 456 pages, height x width: 235x155 mm, weight: 1860 g, XIII, 456 p., 1 Hardback
  • Sērija : Texts in Computer Science
  • Izdošanas datums: 17-Jan-1997
  • Izdevniecība: Springer-Verlag New York Inc.
  • ISBN-10: 0387948937
  • ISBN-13: 9780387948935
  • Hardback
  • Cena: 127,23 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 149,69 €
  • 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: Hardback, 456 pages, height x width: 235x155 mm, weight: 1860 g, XIII, 456 p., 1 Hardback
  • Sērija : Texts in Computer Science
  • Izdošanas datums: 17-Jan-1997
  • Izdevniecība: Springer-Verlag New York Inc.
  • ISBN-10: 0387948937
  • ISBN-13: 9780387948935
This textbook provides a first introduction to mathematical logic which is closely attuned to the applications of logic in computer science. In it the authors emphasize the notion that deduction is a form of computation. While all the traditional subjects of logic are covered thoroughly - syntax, semantics, completeness, and compactness - much of the book deals with less traditional topics such as resolution theorem proving, logic programming, and non-classical logics - modal and intuitionistic - which are becoming increasingly important in computer science. The book also provides a systematic treatment of the elements of set theory, a historical overview of its subjects, and an extensive annotated bibliography.
No previous exposure to logic is assumed, and so this will be suitable for upper level undergraduate or beginning graduate students in computer science or mathematics.

This textbook provides a first introduction to mathematical logic which is closely attuned to the applications of logic in computer science. In it the authors emphasize the notion that deduction is a form of computation. Whilst all the traditional subjects of logic are covered thoroughly: syntax, semantics, completeness, and compactness; much of the book deals with less traditional topics such as resolution theorem proving, logic programming and non-classical logics - modal and intuitionistic - which are becoming increasingly important in computer science. No previous exposure to logic is assumed and so this will be suitable for upper level undergraduates or beginning graduate students in computer science or mathematics.From reviews of the first edition: "... must surely rank as one of the most fruitful textbooks introduced into computer science ... We strongly suggest it as a textbook ..." SIGACT News

Recenzijas

From reviews of the first edition: "... must surely rank as one of the most fruitful textbooks introduced into computer science ... We strongly suggest it as a textbook ..." SIGACT News



From the reviews of the second edition:



"the book achieves its goal of being a unified introduction into classical logic, logic programming and certain non-classical logics. the book succeeded in presenting a uniform framework for describing different logics. The authors thorough approach to describing logic programming, via introduction of resolution-based refutations and subsequent study of different kinds of resolutions allows the reader to gradually switch from the study of logic to the study of logical programming paradigm and provides a lot of intuition about the behavior of logic programs.



As such the book can be recommended both as a textbook for senior/graduate course in logic/logic programming, and as a reading or reference for graduate students in the areas related to discrete mathematics."



(Alexander Dekhtyar, William Gasarchs Book Review Column, SIGACT News)

Papildus informācija

Springer Book Archives
I Propositional Logic.- 1 Orders and Trees.- 2 Propositions, Connectives
and Truth Tables.- 3 Truth Assignments and Valuations.- 4 Tableau Proofs in
Propositional Calculus.- 5 Soundness and Completeness of Tableau Proofs.- 6
Deductions from Premises and Compactness.- 7 An Axiomatic Approach*.- 8
Resolution.- 9 Refining Resolution.- 10 Linear Resolution, Horn Clauses and
PROLOG.- II Predicate Logic.- 1 Predicates and Quantifiers.- 2 The Language:
Terms and Formulas.- 3 Formation Trees, Structures and Lists.- 4 Semantics:
Meaning and Truth.- 5 Interpretations of PROLOG Programs.- 6 Proofs: Complete
Systematic Tableaux.- 7 Soundness and Completeness of Tableau Proofs.- 8 An
Axiomatic Approach*.- 9 Prenex Normal Form and Skolemization.- 10 Herbrands
Theorem.- 11 Unification.- 12 The Unification Algorithm.- 13 Resolution.- 14
Refining Resolution: Linear Resolution.- III PROLOG.- 1 SLD-Resolution.- 2
Implementations: Searching and Backtracking.- 3 Controlling the
Implementation: Cut.- 4 Termination Conditions for PROLOG Programs.- 5
Equality.- 6 Negation as Failure.- 7 Negation and Nonmonotonic Logic.- 8
Computability and Undecidability.- IV Modal Logic.- 1 Possibility and
Necessity; Knowledge or Belief.- 2 Frames and Forcing.- 3 Modal Tableaux.- 4
Soundness and Completeness.- 5 Modal Axioms and Special Accessibility
Relations.- 6 An Axiomatic Approach*.- V Intuitionistic Logic.- 1
Intuitionism and Constructivism.- 2 Frames and Forcing.- 3 Intuitionistic
Tableaux.- 4 Soundness and Completeness.- 5 Decidability and Undecidability.-
6 A Comparative Guide.- VI Elements of Set Theory.- 1 Some Basic Axioms of
Set Theory.- 2 Booles Algebra of Sets.- 3 Relations, Functions and the Power
Set Axiom.- 4 The Natural Numbers, Arithmetic and Infinity.- 5 Replacement,
Choice andFoundation.- 6 Zermelo-Fraenkel Set Theory in Predicate Logic.- 7
Cardinality: Finite and Countable.- 8 Ordinal Numbers.- 9 Ordinal Arithmetic
and Transfinite Induction.- 10 Transfinite Recursion, Choice and the Ranked
Universe.- 11 Cardinals and Cardinal Arithmetic.- Appendix A: An Historical
Overview.- 1 Calculus.- 2 Logic.- 3 Leibnizs Dream.- 4 Nineteenth Century
Logic.- 5 Nineteenth Century Foundations of Mathematics.- 6 Twentieth Century
Foundations of Mathematics.- 7 Early Twentieth Century Logic.- 8 Deduction
and Computation.- 9 Recent Automation of Logic and PROLOG.- 10 The Future.-
Appendix B: A Genealogical Database.- Index of Symbols.- Index of Terms.