{"title":"Logic (Mathematics)","description":null,"products":[{"product_id":"encyclopedia-of-mathematics-and-its-applications-9781107086777","title":"Encyclopedia of Mathematics and its Applications","description":"\u003cp\u003eA comprehensive account that gives equal attention to the combinatorial, logical and applied aspects of partially ordered sets.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52825027772695,"sku":null,"price":12041.86,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781107086777.jpg?v=1780655380"},{"product_id":"perspectives-in-logic-9781107272248","title":"Perspectives in Logic","description":"\u003cp\u003eThis handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52825137119511,"sku":null,"price":10602.08,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781107272248.jpg?v=1780655589"},{"product_id":"lecture-notes-in-logic-9781107521186","title":"Lecture Notes in Logic","description":"\u003cp\u003eA comprehensive introduction to eight major approaches to computation on uncountable mathematical domains.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52827584168215,"sku":null,"price":15052.33,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781107521186.jpg?v=1780657230"},{"product_id":"london-mathematical-society-student-texts-9781108206990","title":"London Mathematical Society Student Texts","description":"\u003cp\u003eA reference book discussing applications of formal language theory to group theory, particularly geometric and computational group theory.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52828611281175,"sku":null,"price":5004.8,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781108206990.jpg?v=1780659792"},{"product_id":"lecture-notes-in-logic-9781108227988","title":"Lecture Notes in Logic","description":"\u003cp\u003eThis groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52828612428055,"sku":null,"price":21073.27,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781108227988.jpg?v=1780659818"},{"product_id":"encyclopedia-of-mathematics-and-its-applications-9781108266123","title":"Encyclopedia of Mathematics and its Applications","description":"\u003cp\u003eOffers a self-contained work presenting basic ideas, classical results, current state of the art and possible future directions in proof complexity.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52828693037335,"sku":null,"price":18324.58,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781108266123.jpg?v=1780660055"},{"product_id":"invitation-to-applied-category-theory-9781108582247","title":"Invitation to Applied Category Theory","description":"\u003cp\u003eCategory theory reveals commonalities between structures of all sorts. This book shows its potential in science, engineering, and beyond.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52833970028823,"sku":null,"price":6005.76,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781108582247.jpg?v=1780661965"},{"product_id":"new-mathematical-monographs-9781108609593","title":"New Mathematical Monographs","description":"\u003cp\u003eOffers a comprehensive presentation of spectral spaces focussing on their topology and close connections with algebra, ordered structures, and logic.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52835587817751,"sku":null,"price":21073.27,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781108609593.jpg?v=1780662636"},{"product_id":"introduction-to-category-theory-9781139235099","title":"Introduction to Category Theory","description":"\u003cp\u003eThe basics of category theory beautifully explained with a wealth of exercises. Solutions are available online.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52867447193879,"sku":null,"price":4973.82,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781139235099.jpg?v=1780899794"},{"product_id":"multiagent-systems-9781139235044","title":"Multiagent Systems","description":"\u003cp\u003eA thorough introduction to a burgeoning interdisciplinary field, with an emphasis on foundational material.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52867447357719,"sku":null,"price":7984.28,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781139235044.jpg?v=1780899799"},{"product_id":"conceptual-mathematics-9781139637763","title":"Conceptual Mathematics","description":"\u003cp\u003eThis truly elementary book on categories introduces retracts, graphs, and adjoints to students and scientists.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52871198802199,"sku":null,"price":6381.12,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781139637763.jpg?v=1780901472"},{"product_id":"cambridge-mathematical-library-9781139930611","title":"Cambridge Mathematical Library","description":"\u003cp\u003eAn abridged text of Principia Mathematica, suitable for an introductory study of logic.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52872597668119,"sku":null,"price":13137.6,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781139930611.jpg?v=1780902764"},{"product_id":"encyclopedia-of-mathematics-and-its-applications-9781139986366","title":"Encyclopedia of Mathematics and its Applications","description":"\u003cp\u003eBased on lax-algebraic and categorical methods, Monoidal Topology provides a unified theory for metric and topological structures with far-reaching applications.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52872650031383,"sku":null,"price":19240.81,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781139986366.jpg?v=1780902985"},{"product_id":"london-mathematical-society-lecture-note-series-9781316290477","title":"London Mathematical Society Lecture Note Series","description":"\u003cp\u003eThis book brings the researcher up to date with recent applications of mathematical logic to number theory.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52875534696727,"sku":null,"price":7853.39,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781316290477.jpg?v=1780904588"},{"product_id":"lecture-notes-in-logic-9781316856949","title":"Lecture Notes in Logic","description":"\u003cp\u003eExplores connections between infinitary model theory and other branches of mathematical logic, with algebraic applications.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52887612653847,"sku":null,"price":15052.33,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9781316856949.jpg?v=1780907166"},{"product_id":"challenges-and-advances-in-computational-chemistry-and-physics-9783031284014","title":"Challenges and Advances in Computational Chemistry and Physics","description":"\u003cp\u003eThis contributed volume overviews recently presented approaches for carrying out QSPR\/QSAR analysis by using a simplifying molecular input-line entry system (SMILES) to represent the molecular structure. In contrast to traditional SMILES, quasi-SMILES is a sequence of special symbols-codes that reflect molecular features and codes of experimental conditions. SMILES and quasi-SMILES serve as a basis to develop QSPR\/QSAR as well Nano-QSPR\/QSAR via the Monte Carlo calculation that provides the so-called optimal descriptors for QSPR\/QSAR models.  The book presents a reliable technology for developing Nano-QSPR\/QSAR while it also includes the description of the algorithms of the Monte Carlo optimization. It discusses the theory and practice of the technique of variational authodecoders (VAEs) based on SMILES and analyses in detail the index of ideality of correlation (IIC) and the correlation intensity index (CII) which are new criteria for the predictive potential of the model. The mathematical apparatus used is simple so that students of relevant specializations can easily follow. This volume is a valuable contribution to the field and will be of great interest to developers of models of physicochemical properties and biological activity, chemical technologists, and toxicologists involved in the area of drug design.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52894915494167,"sku":null,"price":19956.64,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031284014.jpg?v=1781258500"},{"product_id":"synthese-library-9783319499086","title":"Synthese Library","description":"\u003cp\u003eThis monograph looks at causal nets from a philosophical point of view. The author shows that one can build a general philosophical theory of causation on the basis of the causal nets framework that can be fruitfully used to shed new light on philosophical issues. Coverage includes both a theoretical as well as application-oriented approach to the subject.The author first counters David Hume's challenge about whether causation is something ontologically real. The idea behind this is that good metaphysical concepts should behave analogously to good theoretical concepts in scientific theories. In the process, the author offers support for the theory of causal nets as indeed being a correct theory of causation.Next, the book offers an application-oriented approach to the subject. The author shows that causal nets can investigate philosophical issues related to causation. He does this by means of two exemplary applications. The first consists of an evaluation of Jim Woodward's interventionist theory of causation. The second offers a contribution to the new mechanist debate.Introductory chapters outline all the formal basics required. This helps make the book useful for those who are not familiar with causal nets, but interested in causation or in tools for the investigation of philosophical issues related to causation.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52911206007063,"sku":null,"price":9947.04,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783319499086.jpg?v=1781263293"},{"product_id":"model-validation-and-uncertainty-quantification-volume-3-9783030773489","title":"Model Validation and Uncertainty Quantification, Volume 3","description":"\u003cp\u003eModel Validation and Uncertainty Quantification, Volume 3:  Proceedings of the 39th IMAC, A Conference and Exposition on Structural Dynamics, 2021, the third volume of nine from the Conference brings together contributions to this important area of research and engineering.  The collection presents early findings and case studies on fundamental and applied aspects of Model Validation and Uncertainty Quantification, including papers on: Inverse Problems and Uncertainty Quantification Controlling Uncertainty Validation of Models for Operating Environments Model Validation \u0026amp; Uncertainty Quantification: Decision Making Uncertainty Quantification in Structural Dynamics Uncertainty in Early Stage Design Computational and Uncertainty Quantification Tools\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52911249064215,"sku":null,"price":24961.44,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783030773489.jpg?v=1781264288"},{"product_id":"formal-techniques-for-distributed-objects-components-and-systems-9783030780890","title":"Formal Techniques for Distributed Objects, Components, and Systems","description":"\u003cp\u003eThis book constitutes the refereed proceedings of the 41st IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2021, held in Valletta, Malta, in June 2021, as part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021. The 9 regular papers and 4 short papers presented were carefully reviewed and selected from 26 submissions. They cover topics such as: software quality, reliability, availability, and safety; security, privacy, and trust in distributed and\/or communicating systems; service-oriented, ubiquitous, and cloud computing systems; component-and model-based design; object technology, modularity, and software adaptation; self-stabilisation and self-healing\/organising; and verification, validation, formal analysis, and testing of the above. Due to the Corona pandemic this event was held virtually.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52911253192983,"sku":null,"price":5629.15,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783030780890.jpg?v=1781264488"},{"product_id":"computer-science-9783319925912","title":"Computer Science","description":"\u003cp\u003eProviding an in-depth introduction to fundamental classical and non-classical logics, this textbook offers a comprehensive survey of logics for computer scientists. Logics for Computer Science contains intuitive introductory chapters  explaining the  need for logical investigations, motivations for different types of logics  and some of their history. They are followed by strict  formal approach chapters. All chapters contain many detailed examples explaining each of the introduced notions and definitions, well chosen sets of exercises with carefully written solutions, and sets of homework. While many logic books are available, they were written by logicians for  logicians, not for computer scientists. They usually choose one particular way of presenting the material and use a specialized language. Logics for Computer Science discusses Gentzen as well as Hilbert formalizations, first order theories, the Hilbert Program, Godel's  first and second incompleteness theorems and their proofs. It also introduces and discusses some many valued logics, modal logics and introduces algebraic models  for classical, intuitionistic, and modal S4 and  S5 logics.The theory of computation is based on concepts defined by logicians and mathematicians. Logic plays a fundamental role in computer science, and this book explains the basic theorems, as well as different techniques of proving them in classical and some non-classical logics. Important applications derived from concepts of logic for computer technology include Artificial Intelligence and Software Engineering. In addition to Computer Science, this book may also find an audience in mathematics and philosophy courses, and some of the chapters are also useful for a course in Artificial Intelligence.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52914793480471,"sku":null,"price":13700.64,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783319925912.jpg?v=1781506974"},{"product_id":"introduction-to-the-language-of-mathematics-9783030006419","title":"Introduction to the Language of Mathematics","description":"\u003cp\u003eThis is a textbook for an undergraduate mathematics major transition course from technique-based mathematics (such as Algebra and Calculus) to proof-based mathematics. It motivates the introduction of the formal language of logic and set theory and develops the basics with examples, exercises with solutions and exercises without. It then moves to a discussion of proof structure and basic proof techniques, including proofs by induction with extensive examples. An in-depth treatment of relations, particularly equivalence and order relations completes the exposition of the basic language of mathematics. The last chapter treats infinite cardinalities. An appendix gives some complement on induction and order, and another provides full solutions of the in-text exercises.  The primary audience is undergraduate mathematics major, but independent readers interested in mathematics can also use the book for self-study.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52914830835991,"sku":null,"price":5629.15,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783030006419.jpg?v=1781507671"},{"product_id":"algebra-without-borders-classical-and-constructive-nonassociative-algebraic-structures-9783031393341","title":"Algebra without Borders - Classical and Constructive Nonassociative Algebraic Structures","description":"\u003cp\u003eThis book gathers invited, peer-reviewed works presented at the 2021 edition of the Classical and Constructive Nonassociative Algebraic Structures: Foundations and Applications—CaCNAS: FA 2021, virtually held from June 30 to July 2, 2021, in dedication to the memory of Professor Nebojša Stevanović (1962-2009). The papers cover new trends in the field, focusing on the growing development of applications in other disciplines. These aspects interplay in the same cadence, promoting interactions between theory and applications, and between nonassociative algebraic structures and various fields in pure and applied mathematics. In this volume, the reader will find novel studies on topics such as left almost algebras, logical algebras, groupoids and their generalizations, algebraic geometry and its relations with quiver algebras, enumerative combinatorics, representation theory, fuzzy logic and foundation theory, fuzzy algebraic structures, group amalgams, computer-aided development and transformation of the theory of nonassociative algebraic structures, and applications within natural sciences and engineering. Researchers and graduate students in algebraic structures and their applications can hugely benefit from this book, which can also interest any researcher exploring multi-disciplinarity and complexity in the scientific realm.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52915601080599,"sku":null,"price":16203.04,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031393341.jpg?v=1781527745"},{"product_id":"undergraduate-topics-in-computer-science-9783030611156","title":"Undergraduate Topics in Computer Science","description":"\u003cp\u003eThis textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula.The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices.Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory.The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52916518224151,"sku":null,"price":4127.71,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783030611156.jpg?v=1781591021"},{"product_id":"algorithms-for-constructing-computably-enumerable-sets-9783031269042","title":"Algorithms for Constructing Computably Enumerable Sets","description":"\u003cp\u003eLogicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets.  This textbook presents these techniques in a unified way that should appeal to computer scientists. Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called \"classical recursion theory\").  This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems.  These algorithms are little-known outside of a niche within the mathematical logic community.  By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal. Topics and features: ·         All other books in this field focus on the mathematical results, rather than on the algorithms. ·         There are many exercises here, most of which relate to details of the algorithms. ·         The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature. ·         The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms. ·         In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas. Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it. Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science \u0026amp; Engineering, Ohio State University, Columbus, Ohio, US.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52934909362455,"sku":null,"price":6880.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031269042.jpg?v=1781615590"},{"product_id":"synthesis-lectures-on-mathematics-statistics-9783031304880","title":"Synthesis Lectures on Mathematics \u0026 Statistics","description":"\u003cp\u003eThis book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. \u0026amp;quote;Safe\u0026amp;quote; - that is, paradox-free - informal set theory is introduced following on the heels of Russell's Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor's diagonalisation technique. Predicate logic \u0026amp;quote;for the user\u0026amp;quote; is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52935855964439,"sku":null,"price":5003.55,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031304880.jpg?v=1781618332"},{"product_id":"mathematics-of-complexity-and-dynamical-systems-9781461418061","title":"Mathematics of Complexity and Dynamical Systems","description":"\u003cp\u003eMathematics of Complexity and Dynamical Systems is an authoritative reference to the basic tools and concepts of complexity, systems theory, and dynamical systems from the perspective of pure and applied mathematics. Complex systems are systems that comprise many interacting parts with the ability to generate a new quality of collective behavior through self-organization, e.g. the spontaneous formation of temporal, spatial or functional structures. These systems are often characterized by extreme sensitivity to initial conditions as well as emergent behavior that are not readily predictable or even completely deterministic. The more than 100 entries in this wide-ranging, single source work provide a comprehensive explication of the theory and applications of mathematical complexity, covering ergodic theory, fractals and multifractals, dynamical systems, perturbation theory, solitons, systems and control theory, and related topics. Mathematics of Complexity and Dynamical Systems is an essential reference for all those interested in mathematical complexity, from undergraduate and graduate students up through professional researchers.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53573380047127,"sku":null,"price":32969.12,"currency_code":"INR","in_stock":true}]},{"product_id":"synthesis-lectures-on-mathematics-statistics-9783031738340","title":"Synthesis Lectures on Mathematics \u0026 Statistics","description":"\u003cp\u003eThis book aims to introduce readers without a strong mathematical background to the basic ideas of fuzzy set theory and logic. Fuzzy mathematics is the mathematics of vagueness, a universal property of this world. There are many objects that are called vague because they cannot be precisely defined. Since vagueness is so common, a tool is needed to describe it and to effectively deal with it. Fuzzy mathematics is such a tool, and it is used by most researchers and scholars. As such, this book provides a short overview of the field written for non-specialists. This book allows readers to delve into the theory of fuzzy sets and introduces core mathematical ideas without using the usual formalities of books in mathematics, i.e. theorems, proofs, etc.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53573482152215,"sku":null,"price":4377.95,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031738340.jpg?v=1782394140"},{"product_id":"model-validation-and-uncertainty-quantification-volume-3-9783031370038","title":"Model Validation and Uncertainty Quantification, Volume 3","description":"\u003cp\u003eModel Validation and Uncertainty Quantification, Volume 3: Proceedings of the 41st IMAC, A Conference and Exposition on Structural Dynamics, 2023, the third volume of ten from the Conference brings together contributions to this important area of research and engineering. The collection presents early findings and case studies on fundamental and applied aspects of Model Validation and Uncertainty Quantification, including papers on: Introduction of Uncertainty Quantification Uncertainty Quantification in Dynamics Model Form Uncertainty and Selection incl. Round Robin Challenge Sensor and Information Fusion Virtual Sensing, Certification, and Real-Time Monitoring Surrogate Modeling\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53578256843031,"sku":null,"price":27463.84,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031370038.jpg?v=1782461249"},{"product_id":"programs-as-diagrams-9783031348273","title":"Programs as Diagrams","description":"\u003cp\u003eIt is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions. In this unique textbook\/reference, programs are drawn as string diagrams in the language of categories, which display a universal syntax of mathematics (Computer scientists use them to analyze the program semantics; programmers to display the syntax of computations). Here, the string-diagrammatic depictions of computations are construed as programs in a single-instruction programming language.  Such programs as diagrams show how functions are packed in boxes and tied by strings. Readers familiar with categories will learn about the foundations of computability; readers familiar with computability gain access to category theory. Additionally, readers familiar with both are offered many opportunities to improve the approach. Topics and features: Delivers a ‘crash’ diagram-based course in theory of computation Uses single-instruction diagrammatic programming language Offers a practical introduction into categories and string diagrams as computational tools Reveals how computability is programmability, rather than an ‘ether’ permeating computers Provides a categorical model of intensional computation is unique up to isomorphism Serves as a stepping stone into research of computable categories In addition to its early chapters introducing computability for beginners, this flexible textbook\/resource also contains both middle chapters that expand for suitability to a graduate course as well as final chapters opening up new research. Dusko Pavlovic is a professor at the Department of Information and Computer Sciences at the University of Hawaii at Manoa, and by courtesy at the Department of Mathematics and the College of Engineering. He completed this book as an Excellence Professor at Radboud University in Nijmegen, The Netherlands.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53578832609559,"sku":null,"price":6880.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031348273.jpg?v=1782464796"},{"product_id":"lecture-notes-in-computer-science-9783031896101","title":"Lecture Notes in Computer Science","description":"\u003cp\u003eThis book constitutes the refereed proceedings of the 11th Indian Conference on Logic and Its Applications, ICLA 2025, held in Kolkata, India, during February 3–5, 2025. Four out the five invited talks are included in this book. Out of the 26 submissions, the program committee carefully selected 14 papers to be included in the proceedings. The topics included are Mathematics, Computer Science, Philosophy, Linguistics and Cognitive Science. A special feature of ICLA is the inclusion of studies in systems of logic in the Indian tradition, as well as historical research on logic.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53579383734551,"sku":null,"price":6880.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031896101.jpg?v=1782476792"},{"product_id":"computer-science-foundations-and-applied-logic-9783031747625","title":"Computer Science Foundations and Applied Logic","description":"\u003cp\u003eMulti-valued and fuzzy logics provide mathematical and computational tools for handling imperfect information and decision-making with rational collective reasoning and irrational individual judgements. The suggested implementation of multi-valued logics is based on the uninorm and absorbing norm with generating functions defined by probability distributions. Natural extensions of these logics result in non-commutative and non-distributive logics. In addition to Boolean truth values, these logics handle subjective truth and false values and model irrational decisions. Dynamics of decision-making are specified by the subjective Markov process and learning by neural network with extended Tsetlin neurons. Application of the suggested methods is illustrated by modelling of irrational economic decisions and biased reasoning in the wisdom-of-the-crowd method, and by control of mobile robots and navigation of their groups.Topics and features: Bridges the gap between fuzzy and probability methods Includes examples in the field of machine-learning and robots control Defines formal models of subjective judgements and decision-making Presents practical techniques for solving non-probabilistic decision-making problems Initiates further research in non-commutative and non-distributive logicsThe book forms a basis for theoretical studies and practice of decision-making under uncertainty and will be useful for computer scientists and mathematicians interested in multi-valued and fuzzy logic, as well as for engineers working in the field of data mining and data analysis.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53579385667863,"sku":null,"price":22459.04,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031747625.jpg?v=1782476844"},{"product_id":"unitext-9783031716607","title":"UNITEXT","description":"\u003cp\u003eThe main aim of this book is to provide a compact self-contained presentation of the forcing technique devised by Cohen to establish the independence of the continuum hypothesis from the axioms of set theory. The book follows the approach to the forcing technique via Boolean valued semantics independently introduced by Vopenka and Scott\/Solovay; it develops out of notes I prepared for several master courses on this and related topics and aims to provide an alternative (and more compact) account of this topic with respect to the available classical textbooks. The aim of the book is to take up a reader with familiarity with logic and set theory at the level of an undergraduate course on both topics (e.g., familiar with most of the content of introductory books on first-order logic and set theory) and bring her\/him to page with the use of the forcing method to produce independence (or undecidability results) in mathematics. Familiarity of the reader with general topology would also be quite helpful; however, the book provides a compact account of all the needed results on this matter. Furthermore, the book is organized in such a way that many of its parts can also be read by scholars with almost no familiarity with first-order logic and\/or set theory. The book presents the forcing method outlining, in many situations, the intersections of set theory and logic with other mathematical domains. My hope is that this book can be appreciated by scholars in set theory and by readers with a mindset oriented towards areas of mathematics other than logic and a keen interest in the foundations of mathematics.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53579446321431,"sku":null,"price":6254.75,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031716607.jpg?v=1782477632"},{"product_id":"lecture-notes-in-computer-science-9783031959080","title":"Lecture Notes in Computer Science","description":"\u003cp\u003eThis book constitutes the refereed proceedings of the 21st Conference on Computability and Logic, CiE 2025, held in Lisbon, Portugal, during July 14–18, 2025.The 27 full papers included in this book were carefully reviewed and selected from 49 submissions. They focus on computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2025 hadas its motto Crossroads of Computability and Logic: Insights, Inspirations, and Innovations, drawing on the numerous interconnections between computability research and broader logical methodologies, considering both well-established perspectives as well as recent innovations.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53579859624215,"sku":null,"price":14951.84,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783031959080.jpg?v=1782480845"},{"product_id":"computer-science-foundations-and-applied-logic-9783032057419","title":"Computer Science Foundations and Applied Logic","description":"\u003cp\u003eSchemata are formal tools for describing inductive reasoning. They opened a new area in the analysis of inductive proofs.The book introduces schemata for first-order terms, first-order formulas and first-order inference systems. Based on general first-order schemata, the cut-elimination-by-resolution (CERES) method—developed around the year 2000—is extended to schematic proofs. This extension requires the development of schematic methods for resolution and unification which are defined in this book. The added value of proof schemata compared to other inductive approaches consists in the extension of Herbrand’s theorem to inductive proofs (in the form of Herbrand systems, which can be constructed effectively). An application to an analysis of mathematical proof is given.  The work also contains and extends the newest results on schematic unification and corresponding algorithms.Core topics covered:first-order schematacut-elimination by resolutionpoint transition systemsschematic resolutionHerbrand systemsinductive proof analysisThis volume is the first comprehensive work on first-order schemata and their applications. As such, it will be eminently suitable for researchers and PhD students in logic and computer science either working or with an interest in proof theory, inductive reasoning and automated deduction.  Prerequisites are a firm knowledge of first-order logic, basic knowledge of automated deduction and a background in theoretical computer science.Alexander Leitsch and Anela Lolic are affiliated with the Institute of Logic and Computation of the Technische Universität Wien, David M. Cerna with the Czech Academy of Sciences, Institute of Computer Science (Ústav informatiky AV CR, v.v.i.).\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53579896258839,"sku":null,"price":17454.24,"currency_code":"INR","in_stock":true}]},{"product_id":"physics-and-astronomy-9783032090119","title":"Physics and Astronomy","description":"\u003cp\u003eThis textbook is meant for students who have had some prior exposure to quantum mechanics and want to move to the next level. It aims to support those who are a little behind while providing a new perspective for more advanced students.Covering material for a two-semester or three-quarter course, it offers a comprehensive background for further specialized and advanced studies in atomic, nuclear, particle, and condensed matter physics. Since some prior exposure to quantum mechanics is assumed, the most basic topics are treated briefly but with a higher perspective. The book begins with Mathematical Foundations and Basics of Quantum Mechanics. A lot of interesting physics can be explained with One-Dimensional Problems. Subsequent chapters delve into Angular Momentum, Quantum Problems in Higher Dimensions, and Identical Particles. The text then introduces Approximation Methods for Time-Independent Problems, as well as Time-Dependent Quantum Mechanics. The final chapters explore advanced topics, including Electromagnetic Radiation, Scattering Theory, and Relativistic Quantum Mechanics, ensuring a comprehensive understanding of the subject.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53580013961495,"sku":null,"price":8757.15,"currency_code":"INR","in_stock":true}]},{"product_id":"lecture-notes-in-mathematics-9783032087300","title":"Lecture Notes in Mathematics","description":"\u003cp\u003eThis book introduces the category of Cartesian cubical sets and endows it with a Quillen model structure using ideas coming from Homotopy type theory. In particular, recent constructions of cubical systems of univalent type theory are used to determine abstract homotopical semantics of type theory. The celebrated univalence axiom of Voevodsky plays a key role in establishing the basic laws of a model structure, showing that the homotopical interpretation of constructive type theory is not merely possible, but in a certain, precise sense also necessary for the validity of univalence. Fully rigorous proofs are given in diagrammatic style, using the language and methods of categorical logic and topos theory. The intended readers are researchers and graduate students in homotopy theory, type theory, and category theory.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53580026413335,"sku":null,"price":6880.35,"currency_code":"INR","in_stock":true}]},{"product_id":"statistical-learning-with-math-and-python-9789811578779","title":"Statistical Learning with Math and Python","description":"\u003cp\u003eThe most crucial ability for machine learning and data science is mathematical logic for grasping their essence rather than knowledge and experience. This textbook approaches the essence of machine learning and data science by considering math problems and building Python programs. As the preliminary part, Chapter 1 provides a concise introduction to linear algebra, which will help novices read further to the following main chapters. Those succeeding chapters present essential topics in statistical learning: linear regression, classification, resampling, information criteria, regularization, nonlinear regression, decision trees, support vector machines, and unsupervised learning. Each chapter mathematically formulates and solves machine learning problems and builds the programs. The body of a chapter is accompanied by proofs and programs in an appendix, with exercises at the end of the chapter. Because the book is carefully organized to provide the solutions to the exercises in each chapter, readers can solve the total of 100 exercises by simply following the contents of each chapter. This textbook is suitable for an undergraduate or graduate course consisting of about 12 lectures. Written in an easy-to-follow and self-contained style, this book will also be perfect material for independent learning.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53590606512407,"sku":null,"price":4127.71,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9789811578779.jpg?v=1783494809"},{"product_id":"sparse-estimation-with-math-and-r-9789811614460","title":"Sparse Estimation with Math and R","description":"\u003cp\u003eThe most crucial ability for machine learning and data science is mathematical logic for grasping their essence rather than knowledge and experience. This textbook approaches the essence of sparse estimation by considering math problems and building R programs.   Each chapter introduces the notion of sparsity and provides procedures followed by mathematical derivations and source programs with examples of execution. To maximize readers’ insights into sparsity, mathematical proofs are presented for almost all propositions, and programs are described without depending on any packages. The book is carefully organized to provide the solutions to the exercises in each chapter so that readers can solve the total of 100 exercises by simply following the contents of each chapter. This textbook is suitable for an undergraduate or graduate course consisting of about 15 lectures (90 mins each). Written in an easy-to-follow and self-contained style, this book will also be perfectmaterial for independent learning by data scientists, machine learning engineers, and researchers interested in linear regression, generalized linear lasso, group lasso, fused lasso, graphical models, matrix decomposition, and multivariate analysis. This book is one of a series of textbooks in machine learning by the same author. Other titles are:  - Statistical Learning with Math and R (https:\/\/www.springer.com\/gp\/book\/9789811575679) - Statistical Learning with Math and Python (https:\/\/www.springer.com\/gp\/book\/9789811578762) - Sparse Estimation with Math and Python\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53643648106775,"sku":null,"price":3752.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9789811614460.jpg?v=1783494785"},{"product_id":"computer-science-9789819798162","title":"Computer Science","description":"\u003cp\u003eMathematical logic is an important basis for mathematics, computer science and artificial intelligence alike. This book provides a comprehensive introduction to various logics, including classical propositional logic and first-order predicate logic, as well as equational logic, temporal logic, and Hoare logic. In addition, it presents proof procedures for classical logics and decision procedures for checking the satisfiability of logical formulas.The book assumes no background in logic. It presents logics as practical tools for solving various problems in artificial intelligence and formal verification. Accordingly, it is well suited for (junior and senior) undergraduate and graduate students majoring in computer science or mathematics. Each chapter includes roughly a dozen exercise problems, so as to help the reader understand the concepts and techniques discussed.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53643719770391,"sku":null,"price":6880.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9789819798162.jpg?v=1783497160"},{"product_id":"university-texts-in-the-mathematical-sciences-9789819746439","title":"University Texts in the Mathematical Sciences","description":"\u003cp\u003ePrimarily designed for graduate students of mathematics, this textbook delves into Naive set theory, offering valuable insights for senior undergraduate students and researchers specializing in set theory. Commencing with a comprehensive exploration of functions and relations, the book extends its coverage to various applications of Naive set theory across multiple mathematical branches, including real analysis, linear and abstract algebra, general topology, and introductory aspects of complex analysis and measure theory. The text meticulously introduces cardinal and ordinal numbers, along with transfinite induction, following the natural progression discovered by Cantor during his examination of trigonometric series. While this book provides a solid foundation, students intrigued by set theory for its intrinsic value should recognize that the subject extends far beyond the scope of this text.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":53643720556823,"sku":null,"price":6880.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9789819746439.jpg?v=1783497192"},{"product_id":"essentials-9783658317393","title":"essentials","description":"\u003cp\u003e\u003c\/p\u003e\u003cp\u003eIn diesem \u003ci\u003eessential\u003c\/i\u003e werden wesentliche Konzepte der Berechenbarkeitstheorie erörtert. Zunächst werden unterschiedliche Modelle der Berechenbarkeit eingeführt und ihre semantische Gleichwertigkeit gezeigt. Dieses Resultat steht in Einklang mit der Church-Turing-These, nach der jede intuitiv berechenbare Funktion partiell-rekursiv ist. Neben zentralen Instrumenten der Berechenbarkeit, wie etwa der Gödelisierung von berechenbaren Funktionen und der Existenz universeller berechenbarer Funktionen, stehen unentscheidbare Probleme im Fokus, wie etwa das Halteproblem sowie das Wortproblem für die Term-Ersetzung. Semi-entscheidbare Mengen werden beleuchtet und die zentralen Sätze von Rice und Rice-Shapiro werden skizziert. \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":54152822849815,"sku":null,"price":624.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783658317393.jpg?v=1784531200"},{"product_id":"die-blaue-stunde-der-informatik-9783658272128","title":"Die blaue Stunde der Informatik","description":"\u003cp\u003e\u003cb\u003eEin Buch über die Unendlichkeit\u003c\/b\u003e\u003c\/p\u003e\u003cp\u003eWer glaubt, dass sich Rechnen auf trockene Formeln und Zahlen beschränkt, wird mit „Aspekte des Unendlichen – Eine kleine Erzählung für Nichtmathematiker“ sein blaues Wunder erleben. Dieses Buch spricht alle Leser an, die nicht nur die Logik, sondern auch die Poesie der Unendlichkeit erforschen möchten. Anstatt Laien mit kryptischem Akademikerjargon zu verwirren, übersetzt es komplexe Sachverhalte in leicht verständliche Erklärungen. So können auch Einsteiger erfahren, welche Überraschungen die Mengenlehre bereithält.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eVon nicht abzählbaren Größen und unentscheidbaren Fragen\u003c\/p\u003e\u003cp\u003eDie Wissenschaft der mathematischen Unendlichkeit umfasst zahlreiche Problemstellungen, die ebenso anspruchsvoll wie spannend sind. Dazu gehören unter anderem:\u003c\/p\u003e\u003cp\u003e·         die Bibliothek von Babel\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e·         diskontinuierliche Kontinua\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e·         Unmengen\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e·         Paradoxien und Antinomien\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eUm solche theoretischen Ansätze in ihren Grundzügen zu begreifen, braucht es keinen Hochschulabschluss. Lutz Prieses Buch über die Mathematik der Unendlichkeit verwandelt abstrakte Konzepte in lebensnahe Zusammenhänge. Der Autor ist promovierter Logiker und hält seit seiner Pensionierung regelmäßig Vorlesungen zu Themen der Mathematik und Informatik. Dank seiner langjährigen Tätigkeit als Hochschuldozent gelingt es ihm, mit einer unterhaltsamen Sprache Anfänger und Experten gleichermaßen zu fesseln. Dabei steht vor allem die Verbindung zwischen mathematischen und philosophischen Problemen im Vordergrund:\u003c\/p\u003e\u003cp\u003e·         Wie genau können wir mit Zahlen die unendlichen Weiten des Weltalls erfassen?\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e·         Inwiefern spiegeln die Grenzen des Rechnens die Grenzen des menschlichen Daseins wider?\u003cbr\u003e\u003c\/p\u003e·         Wie können wir Unvorstellbares vorstellbar machen?\u003cbr\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003ePrieses Buch über die Unendlichkeit in der Mathematik liefert keine endgültigen Antworten auf diese Fragen. Vielmehr regt es Leser dazu an, sich selbst auf die Suche zu machen und eigene Ideen zu entwickeln. Wie es der Titel verspricht, lädt „Aspekte des Unendlichen“ zu einer schier endlosen Reise durch die Gedankenwelt ein.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":54160929849623,"sku":null,"price":3752.35,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783658272128.jpg?v=1784534860"},{"product_id":"przises-denken-fr-informatiker-9783662549735","title":"Präzises Denken für Informatiker","description":"\u003cp\u003eDas Lehrbuch befasst sich mit dem präzisen Denken, einer Schlüsselkompetenz im Studium der Informatik. Es bildet die Vorstufe für das Verständnis der logischen Grundfunktionen der Informatik. \u003c\/p\u003e Das Erlernen der mathematischen Logik ist ein wesentlicher Bestandteil des Grundstudiums, da das logische Denken in der Informatik auf den gleichen Regeln und Techniken basiert wie in der Mathematik. Der Autor führt umfassend in die Aussagenlogik ein und erklärt unter anderem die Bedeutungen von logischer Äquivalenz, Implikation und Induktion für diesen Fachbereich. Darüber hinaus definiert er den Beweis aus Sicht der Mathematik und stellt grundlegende Beweisstrategien vor, die im Studium benötigt werden. Mit den in diesem Lehrbuch vorgestellten Techniken des präzisen Denkens erwerben die Studenten die Fähigkeit, Begriffe punktgenau zu definieren, Aussagen trennscharf zu formulieren und ihre Richtigkeit angemessen zu begründen. Viele praxisnahe Aufgaben und Lösungshinweise innerhalb derKapitel erleichtern die Überprüfung und Vertiefung des Lernstoffs.\u003cp\u003e\u003c\/p\u003e \u003cp\u003eDer Autor richtet sich vornehmlich an Bachelorstudenten der ersten Semester. Sie finden in diesem Werk eine optimale Vorbereitung auf die Logik-Seminare ihres Informatikstudiums. Die vermittelten Kompetenzen verbessern dabei nicht nur das Verständnis im Informatik-Studium, sondern sind ebenso für das spätere Berufsleben von großer Bedeutung. Darüber hinaus erhalten auch interessierte Laien mit diesem Buch einen interessanten Einblick in die Welt der Informatik und Mathematik und lernen, dass die Fähigkeit zu präzisem Denken auch jenseits dieser Fachbereiche hilfreich sein kann. \u003c\/p\u003e\u003cbr\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":54178451620119,"sku":null,"price":2751.39,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783662549735.jpg?v=1784547461"}],"url":"https:\/\/payment.letskitaboo.com\/ur\/collections\/logic-mathematics.oembed?page=3","provider":"Kitaboo One eStore","version":"1.0","type":"link"}