About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 90. Chapters: Peano axioms, Boolean satisfiability problem, Presburger arithmetic, Fuzzy logic, Denotational semantics, Combinational logic, Precondition, Postcondition, Combinatory logic, Intuitionistic logic, HOL theorem prover family, Logic for Computable Functions, Curry-Howard correspondence, Dynamic logic, Type-2 fuzzy sets and systems, Rewriting, Karnaugh map, Abstract rewriting system, Race condition, Computation tree logic, Intuitionistic type theory, Assertion, Functional completeness, Satisfiability Modulo Theories, Undecidable problem, Automated reasoning, Game semantics, Event calculus, Operational semantics, Bisimulation, Perceptual Computing, Semantics of programming languages, Topological computing, Structural induction, Computability logic, Proof complexity, CTL*, Q0 Logic, Formal verification, Propositional proof system, Twelf, Backward chaining, Multi-Agent Programming Contest, Runtime verification, Typed lambda calculus, Frege system, Combs method, Horn clause, Ordered Weighted Averaging Aggregation Operators, Maximum satisfiability problem, Bunched logic, WalkSAT, Horn-satisfiability, Circuit minimization, Normalization property, Boolean circuit, Forward chaining, Racetrack problem, Fluent, Prolog, Knowledge Interchange Format, Star-free language, Stuttering equivalence, Logical Methods in Computer Science, Compcert, Truth bit, Herbrand Award, IEEE Symposium on Logic in Computer Science, Geometry of interaction, Journal of Logic and Computation, Axiomatic semantics, Journal of Automated Reasoning, Decidable sublanguages of set theory, OBJ, Preferential entailment, State space enumeration, Model elimination, Hennessy-Milner logic, Alternating-time Temporal Logic. Excerpt: The Curry-Howard correspondence is the direct relationship between computer programs and proofs in programming language theory and proof th...
