# Category:Logic in computer science

Computing portal |

Here is a list of articles in the Logic in computer science category of the Computing portal that unifies foundations of mathematics and computations using computers.

Wikimedia Commons has media related to .Logic in computer science |

**Logic in computer science** (or computational logic) is that branch of mathematical logic which is approximately the intersection between mathematical logic and computer science. It contains:

- Those investigations into logic that are guided by applications in computer science. For example:
- Rewriting systems, Combinatory logic and Abstract interpretation;

- Fundamental concepts in computer science that are naturally expressible in logical form. For example:
- Type theory (used in type systems), Formal semantics of programming languages, Hoare logic, and Logic programming;

- Applications of fundamental concepts derived from the theory of computation that cast light on questions of pure logic. For example:
- Curry-Howard correspondence and Game semantics;

- Tools for logicians considered as applied computer science. For example:

## Subcategories

This category has the following 12 subcategories, out of 12 total.

### A

### C

### F

### G

### L

### M

### P

### T

### U

## Pages in category "Logic in computer science"

The following 99 pages are in this category, out of 99 total.

- Logic in computer science
*(computing)* - Model checking
*(computing)*

### A

- Abstract rewriting system
*(computing)* - ACM Transactions on Computational Logic
*(computing)* - Algebraic semantics (computer science)
*(computing)* - Alternating-time temporal logic
*(computing)* - Anti-unification (computer science)
*(computing)* - Assertion (software development)
*(computing)* - Automated reasoning
*(computing)* - Axiomatic semantics
*(computing)*

### B

- Backward chaining
*(computing)* - Bisimulation
*(computing)* - Boolean circuit
*(computing)* - Boolean flag
*(computing)* - Boolean satisfiability problem
*(computing)* - Büchi arithmetic
*(computing)* - Bunched logic
*(computing)*

### C

- Combinational logic
*(computing)* - Combinatory logic
*(computing)* - CompCert
*(software)* - Computability logic
*(computing)* - Computation tree logic
*(computing)* - Computational logic
*(computing)* - CTL*
*(computing)* - Curry–Howard correspondence
*(computing)*

### D

- Decidable sublanguages of set theory
*(computing)* - Denotational semantics
*(computing)* - Dershowitz–Manna ordering
*(computing)* - DiVincenzo's criteria
*(computing)* - Dynamic logic (modal logic)
*(computing)*

### E

- Event calculus
*(computing)*

### F

- Fluent (artificial intelligence)
*(computing)* - Formal verification
*(computing)* - Forward chaining
*(computing)* - Frege system
*(computing)* - Functional completeness
*(computing)* - Fuzzy control
*(computing)* - Combs method
*(computing)* - Fuzzy logic
*(computing)*

### G

- Game semantics
*(computing)* - Geometry of interaction
*(computing)*

### H

- Hennessy–Milner logic
*(computing)* - Herbrand Award
*(computing)* - HOL (proof assistant)
*(computing)* - Horn clause
*(computing)* - Horn-satisfiability
*(computing)*

### I

- Intuitionistic logic
*(computing)* - Intuitionistic type theory
*(computing)*

### J

- Journal of Automated Reasoning
*(computing)* - Journal of Logic and Computation
*(computing)*

### K

- Karnaugh map
*(computing)* - Knowledge Interchange Format
*(computing)*

### L

- ΛProlog
*(computing)* - Logic for Computable Functions
*(computing)* - Logic optimization
*(computing)* - Logical framework
*(computing)* - Logical Methods in Computer Science
*(computing)*

### M

- Marquand diagram
*(computing)* - Maximum satisfiability problem
*(computing)* - Model elimination
*(computing)* - Multi-Agent Programming Contest
*(computing)* - Noise-based logic
*(computing)*

### N

- Normalization property (abstract rewriting)
*(computing)*

### O

- OBJ (programming language)
*(computing)* - Operational semantics
*(computing)* - Ordered weighted averaging aggregation operator
*(computing)*

### P

- Peano axioms
*(computing)* - Perceptual computing
*(computing)* - Postcondition
*(computing)* - Precondition
*(computing)* - Preferential entailment
*(computing)* - Presburger arithmetic
*(computing)* - Proof complexity
*(computing)* - Propositional proof system
*(computing)*

### Q

- Q0 (mathematical logic)
*(computing)*

### R

- Race condition
*(computing)* - Racetrack problem
*(computing)* - Rewriting
*(computing)* - Runtime verification
*(computing)*

### S

- Satisfiability modulo theories
*(computing)* - Semantics (computer science)
*(computing)* - Separation logic
*(computing)* - Sequential logic
*(computing)* - Star-free language
*(computing)* - State space enumeration
*(computing)* - Structural induction
*(computing)* - Stuttering equivalence
*(computing)* - Successor function
*(computing)* - Symposium on Logic in Computer Science
*(computing)*

### T

- Tseytin transformation
*(computing)* - Twelf
*(computing)* - Type-1 OWA operators
*(computing)* - Type-2 fuzzy sets and systems
*(computing)* - Typed lambda calculus
*(computing)*

### U

- Undecidable problem
*(computing)* - Unification (computer science)
*(computing)*

### V

- Veitch chart
*(computing)*

### W

- WalkSAT
*(computing)* - Weakest precondition
*(computing)*