Logic in computer science

system for reasoning about vagueness

method to simplify boolean algebra expressions; refinement of Edward Veitch's 1952 Veitch diagram

axiomatic system for the natural numbers

type of logic circuit

type of digital logic which is implemented by boolean circuits

situation in computer system that occurs when multiple processes try to access a common resource

problem of determining if a Boolean formula could be made true

the field concerned with the rigorous mathematical study of the meaning of programming languages

logical formalism using combinators instead of variables

various systems of symbolic logic

act of proving or disproving the correctness of intended algorithms

clause (a disjunction of literals) with at most one positive, i.e. unnegated, literal

algorithmic process of solving equations between symbolic expressions

subfield of computer science and logic

in computer programming, statement that a predicate is always true at that point in code execution

the direct relationship between computer programs and mathematical proofs

approach of formalizing the meanings of programming languages by constructing mathematical objects (called denotations) that describe the meanings of expressions from the languages

In mathematics, linguistics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines, or reduction systems). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects.

category of formal programming language semantics

verifying whether a finite-state model meets a given specification

decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer

form of mathematical proof

method of forming inferences

approach based on mathematical logic for proving the correctness of computer programs; closely related to Hoare logic; define the meaning of a command in a program by describing its effect on assertions about the program state

elementary operation on a natural number

first-order theory of the natural numbers with addition

property of a set of logical connectives which can express all possible truth tables by combining members of the set

model of computation

typed formalism that uses the lambda-symbol (λ) to denote anonymous function abstraction

academic discipline

problem of determining whether a mathematical formula is satisfiable

alternative foundation of mathematics

In computer programming, a postcondition is a condition or predicate that must always be true just after the execution of some section of code or after an operation in a formal specification. Postconditions are sometimes tested using assertions within the code itself. Often, postconditions are simply included in the documentation of the affected section of code.

In computer programming, a precondition is a condition or predicate that must always be true just prior to the execution of some section of code or before an operation in a formal specification.

In theoretical computer science, a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way in that one system simulates the other and vice versa.

theory in computer science

interpretation of intuitionistic logic

use of logic to perform or reason about computation

award for research contributions to automated deduction

operation in Boolean circuit theory

Anti-unification is the process of constructing a generalization common to two given symbolic expressions. As in unification, several frameworks are distinguished depending on which expressions (also called terms) are allowed, and which expressions are considered equal. If variables representing functions are allowed in an expression, the process is called "higher-order anti-unification", otherwise "first-order anti-unification". If the generalization is required to have an instance literally equal to each input expression, the process is called "syntactical anti-unification", otherwise "E-ant

In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given conjunction of propositional Horn clauses is satisfiable or not. Horn-satisfiability and Horn clauses are named after Alfred Horn.

extension of modal logic

process in digital electronics and integrated circuit design

formal system for transcribing expressions into equivalent terms

an object that cannot be rewritten further