ISBN: 9781919135021 - Applied Set Theory: Foundations and Practice for Computing, Data, and Engineering (9 results)

Paperback or Softback. Condition: New. Applied Set Theory: Foundations and Practice for Computing, Data, and Engineering. Book.

Condition: New.

Paperback. Condition: Brand New. 210 pages. 4.00x0.57x6.00 inches. In Stock.

Taschenbuch. Condition: Neu. Neuware - This pocket-size book introduces set theory and its applications to computing, data, and engineering. We start with basic concepts such as membership, equality, subsets, relations, and functions. We then consider equivalence, order, cardinality, induction, and recursion. We also discuss infinite sets and the axioms of set theory, along with their consequences for representation and computation.The applications include Boolean logic, relational databases, programming collections and types, formal specification with Z, B, and Alloy, combinatorial counting, probability, and graphs. The same mathematical concepts apply across contexts. For example, the distinction between sets and multisets helps explain how SQL handles duplicates. Relations model dependencies and connectivity. Different independence assumptions lead to different conclusions about collision probabilities. We also consider fuzzy sets, rough sets, and multisets as generalizations that require separate examination of their operations and laws.We use definitions, theorems, and worked examples throughout. We pay particular attention to the assumptions behind mathematical results and the differences between abstract models and their software implementations.The book is intended for software developers, data analysts, engineers, and students interested in the mathematical foundations of their work. A notation reference, an annotated bibliography, and an index are included for further study and practical reference.…

Paperback. Condition: new. Paperback. This pocket-size book introduces set theory and its applications to computing, data, and engineering. We start with basic concepts such as membership, equality, subsets, relations, and functions. We then consider equivalence, order, cardinality, induction, and recursion. We also discuss infinite sets and the axioms of set theory, along with their consequences for representation and computation.The applications include Boolean logic, relational databases, programming collections and types, formal specification with Z, B, and Alloy, combinatorial counting, probability, and graphs. The same mathematical concepts apply across contexts. For example, the distinction between sets and multisets helps explain how SQL handles duplicates. Relations model dependencies and connectivity. Different independence assumptions lead to different conclusions about collision probabilities. We also consider fuzzy sets, rough sets, and multisets as generalizations that require separate examination of their operations and laws.We use definitions, theorems, and worked examples throughout. We pay particular attention to the assumptions behind mathematical results and the differences between abstract models and their software implementations.The book is intended for software developers, data analysts, engineers, and students interested in the mathematical foundations of their work. A notation reference, an annotated bibliography, and an index are included for further study and practical reference. A pocket introduction to set theory and its applications to computing, data, and engineering: relations, functions, orders, cardinality, ZFC, and their use in databases, types, specification, counting, probability, and graphs. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Paperback. Condition: new. Paperback. This pocket-size book introduces set theory and its applications to computing, data, and engineering. We start with basic concepts such as membership, equality, subsets, relations, and functions. We then consider equivalence, order, cardinality, induction, and recursion. We also discuss infinite sets and the axioms of set theory, along with their consequences for representation and computation.The applications include Boolean logic, relational databases, programming collections and types, formal specification with Z, B, and Alloy, combinatorial counting, probability, and graphs. The same mathematical concepts apply across contexts. For example, the distinction between sets and multisets helps explain how SQL handles duplicates. Relations model dependencies and connectivity. Different independence assumptions lead to different conclusions about collision probabilities. We also consider fuzzy sets, rough sets, and multisets as generalizations that require separate examination of their operations and laws.We use definitions, theorems, and worked examples throughout. We pay particular attention to the assumptions behind mathematical results and the differences between abstract models and their software implementations.The book is intended for software developers, data analysts, engineers, and students interested in the mathematical foundations of their work. A notation reference, an annotated bibliography, and an index are included for further study and practical reference. A pocket introduction to set theory and its applications to computing, data, and engineering: relations, functions, orders, cardinality, ZFC, and their use in databases, types, specification, counting, probability, and graphs. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Paperback. Condition: new. Paperback. This pocket-size book introduces set theory and its applications to computing, data, and engineering. We start with basic concepts such as membership, equality, subsets, relations, and functions. We then consider equivalence, order, cardinality, induction, and recursion. We also discuss infinite sets and the axioms of set theory, along with their consequences for representation and computation.The applications include Boolean logic, relational databases, programming collections and types, formal specification with Z, B, and Alloy, combinatorial counting, probability, and graphs. The same mathematical concepts apply across contexts. For example, the distinction between sets and multisets helps explain how SQL handles duplicates. Relations model dependencies and connectivity. Different independence assumptions lead to different conclusions about collision probabilities. We also consider fuzzy sets, rough sets, and multisets as generalizations that require separate examination of their operations and laws.We use definitions, theorems, and worked examples throughout. We pay particular attention to the assumptions behind mathematical results and the differences between abstract models and their software implementations.The book is intended for software developers, data analysts, engineers, and students interested in the mathematical foundations of their work. A notation reference, an annotated bibliography, and an index are included for further study and practical reference. A pocket introduction to set theory and its applications to computing, data, and engineering: relations, functions, orders, cardinality, ZFC, and their use in databases, types, specification, counting, probability, and graphs. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…