000 04139nam a22005655i 4500
001 978-3-030-87882-5
003 DE-He213
005 20240423130058.0
007 cr nn 008mamaa
008 211203s2021 sz | s |||| 0|eng d
020 _a9783030878825
_9978-3-030-87882-5
024 7 _a10.1007/978-3-030-87882-5
_2doi
050 4 _aQA76.9.C62
072 7 _aUK
_2bicssc
072 7 _aCOM036000
_2bisacsh
072 7 _aUK
_2thema
082 0 4 _a004.01513
_223
100 1 _aHou, Zhe.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aFundamentals of Logic and Computation
_h[electronic resource] :
_bWith Practical Automated Reasoning and Verification /
_cby Zhe Hou.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aX, 222 p. 34 illus., 6 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTexts in Computer Science,
_x1868-095X
505 0 _a1. Introduction to Logic -- 2. First-order Logic -- 3. Non-classical Logics -- 4. Automata Theory and Formal Languages -- 5. Turing Machines and Computability -- 6. Logic is Computation.
520 _aAlthough the fields of logic and computation are intrinsically related, most courses treat the two topics separately. This unique textbook aims to compress and unify important concepts of logical reasoning and computational theory, facilitating an in-depth understanding. Delivering theory with practical approaches, the book features early chapters accompanied by exercises in Isabelle/HOL, a popular and user-friendly theorem prover. Latter chapters address modelling and verification in Process Analysis Toolkit (PAT), a feature-rich model checker based on Hoare’s Communicating Sequential Processes. The exposition focuses on the syntax, semantics and proof theory of various logics, as well as on automata theory, formal languages, computability, and complexity. It also builds a hybrid skill set of practical theorem proving and model checking, which will provide a solid grounding for future research or work involving formal methods. Topicsand features: Offers a transition from logic to computation via linear temporal logic and state machines Includes exercises from widely-used software applications Provides entry-level tutorials for Isabelle/HOL and PAT Employs many examples from the Archives of Formal Proofs, as well as many examples of PAT models Introduces classical and nonclassical logics in an integrated presentation Discusses lambda calculus, recursive functions and Turing machines Concludes by addressing the Curry-Howard correspondence, which unifies logic and computation The work is optimal for undergraduate students striving for a degree in computer science. In addition, it will be an excellent foundational volume for research students considering higher-degree research programs. Zhe Hou is a lecturer in the School of Information and Communication Technology at Griffith University, Nathan, Australia. His research pursuits include explainable AI, autonomous systems, formal verification, and automated reasoning.
650 0 _aComputer arithmetic and logic units.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aComputers.
650 1 4 _aArithmetic and Logic Structures.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aHardware Performance and Reliability.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030878818
776 0 8 _iPrinted edition:
_z9783030878832
776 0 8 _iPrinted edition:
_z9783030878849
830 0 _aTexts in Computer Science,
_x1868-095X
856 4 0 _uhttps://doi.org/10.1007/978-3-030-87882-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c184799
_d184799