Logic for Applications: Texts in Computer Science
Autor Anil Nerode, Richard A. Shoreen Limba Engleză Paperback – 28 sep 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 323.38 lei 6-8 săpt. | |
Springer – 28 sep 2012 | 323.38 lei 6-8 săpt. | |
Hardback (1) | 894.62 lei 6-8 săpt. | |
Springer – 17 ian 1997 | 894.62 lei 6-8 săpt. |
Din seria Texts in Computer Science
- 20% Preț: 412.42 lei
- 20% Preț: 409.70 lei
- 20% Preț: 370.59 lei
- 20% Preț: 474.58 lei
- 20% Preț: 306.35 lei
- 20% Preț: 444.91 lei
- 20% Preț: 503.87 lei
- 20% Preț: 379.63 lei
- 20% Preț: 444.93 lei
- 20% Preț: 305.30 lei
- 20% Preț: 392.09 lei
- 20% Preț: 1178.49 lei
- 20% Preț: 406.21 lei
- 20% Preț: 675.35 lei
- 20% Preț: 515.34 lei
- 15% Preț: 603.96 lei
- 20% Preț: 355.85 lei
- 20% Preț: 338.08 lei
- 20% Preț: 172.25 lei
- 20% Preț: 313.09 lei
- 20% Preț: 373.83 lei
- 20% Preț: 588.42 lei
- 20% Preț: 704.33 lei
- 20% Preț: 332.44 lei
- 20% Preț: 628.43 lei
- Preț: 433.71 lei
- 20% Preț: 508.38 lei
- 20% Preț: 339.42 lei
- Preț: 365.61 lei
- 20% Preț: 326.66 lei
- 20% Preț: 330.57 lei
- 20% Preț: 339.95 lei
- 20% Preț: 557.18 lei
- 20% Preț: 188.98 lei
- 23% Preț: 726.93 lei
- 20% Preț: 308.23 lei
- 20% Preț: 564.38 lei
- 20% Preț: 562.17 lei
- Preț: 454.30 lei
- 20% Preț: 524.11 lei
- 20% Preț: 339.62 lei
Preț: 323.38 lei
Preț vechi: 404.22 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
61.93€ • 67.02$ • 51.63£
61.93€ • 67.02$ • 51.63£
Carte tipărită la comandă
Livrare economică 09-23 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461268550
ISBN-10: 1461268559
Pagini: 476
Ilustrații: XIII, 456 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:Softcover reprint of the original 2nd ed. 1997
Editura: Springer
Colecția Springer
Seria Texts in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 1461268559
Pagini: 476
Ilustrații: XIII, 456 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:Softcover reprint of the original 2nd ed. 1997
Editura: Springer
Colecția Springer
Seria Texts in Computer Science
Locul publicării:New York, NY, United States
Public țintă
Professional/practitionerCuprins
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 Herbrand’s 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 Boole’s 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 Leibniz’s 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.
Recenzii
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 author’s 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 Gasarch’s Book Review Column, 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 author’s 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 Gasarch’s Book Review Column, SIGACT News)