000			02798nam a2200349Ia 4500
000			03412nam a22003855i 4500
001			978-3-031-21112-6
003			DE-He213
005			20240319120756.0
007			cr nn 008mamaa
008			230101s2023 sz | s |||| 0|eng d
020			_a9783031211126 _9978-3-031-21112-6
082			_a4.0151
100			_aFarmer, William M. _928363
245			_aSimple Type Theory _cby William M. Farmer. _h[electronic resource] :
250			_a1st ed. 2023.
260			_aCham _bSpringer International Publishing _c2023
300			_aXIV, 295 p. 10 illus., 3 illus. in color. _bonline resource.
520			_aThis unique textbook, in contrast to a standard logic text, provides the reader with a logic that actually can be used in practice to express and reason about mathematical ideas. The book is an introduction to simple type theory, a classical higher-order version of predicate logic that extends first-order logic. It presents a practice-oriented logic called Alonzo that is based on Alonzo Church's formulation of simple type theory known as Church's type theory. Unlike traditional predicate logics, Alonzo admits undefined expressions. The book illustrates, using Alonzo, how simple type theory is suited ideally for reasoning about mathematical structures and constructing libraries of mathematical knowledge. Topics and features: Offers the first book-length introduction to simple type theory as a predicate logic Provides the reader with a logic that is close to mathematical practice Presents the tools needed to build libraries of mathematical knowledge Employs two semantics, one for mathematics and one for logic Emphasizes the model-theoretic view of predicate logic Includes several important topics, such as definite description and theory morphisms, not usually found in standard logic textbooks Aimed at students of computing and mathematics at the graduate or upper-undergraduate level, this book is also well-suited for mathematicians, computing professionals, engineers, and scientists who need a practical logic for expressing and reasoning about mathematical ideas. William M. Farmer is a Professor in the Department of Computing and Software at McMaster University in Hamilton, Ontario, Canada.
650			_aComputational complexity. _928364
650			_aComputational Complexity. _928365
650			_aComputer Science Logic and Foundations of Programming. _928366
650			_aComputer science. _928367
650			_aFormal Reasoning. _928368
650			_aMathematical Logic and Foundations. _928369
650			_aMathematical logic. _928370
650			_aReasoning. _928371
650			_aSet theory. _928372
650			_aSet Theory. _928373
856			_uhttps://doi.org/10.1007/978-3-031-21112-6
942			_cEBK _2ddc
999			_c14953 _d14953