O'Reilly logo

Discrete Structures, Logic, and Computability, 4th Edition by James L. Hein

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Index

Note: Page numbers followed by f indicate material in figures.

A

a posteriori probability, 341

a priori probability, 341

AA. See assignment axiom

AAA. See array assignment axiom

Abel’s summation transformation, 303

absorption laws

Boolean algebra, 638

logic, 420

sets, 29, 30

abstract algebra, 621

axioms for, 623

abstract data type, 656–671

binary tree, 667–668

data structures, 660–669

lists, 661–662

natural numbers, 657–660

priority queue, 668–669

queues, 664–666

stack, 662–664

accept, 749, 750, 752, 802, 804, 805, 835

accumulating parameters, 285

Ackermann, W., 468–469

Ackermann’s function, 284, 854

acyclic graph, 695

acyclic transitive closure, 608

addition rule (add), 439

additive cipher, 119

address polynomials, 46

adequate complete, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required