A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
Automated theorem proving is the proving of mathematical theorems by a computer program.
A partial order is a binary relation over a set which is reflexive, antisymmetric, and transitive.
A proof assistant is an application program that helps humans construct machine-checked proofs. General questions about proof assistants can also be asked on the Proof Assistants Stack Exchange site.
questions about attaining and maintaining a career in fields related to theoretical computer science
Questions about advice and nonuniformity
Given a specification, does a program satisfy it?
A path in a graph is said to be Hamiltonian if it visits each vertex exactly once.
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.
Calculus of Constructions (CoC) is a dependent type system. It's on the lambda cube and is implemented in the Coq proof assistant.
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time
Given a program and the input for it, does it halt or run forever?
Topology the study of objects that can be continuously deformed into other objects without tearing or making holes in the object. It can also mean a family of sets that have the property of a topologi…
CSP stands for the constraint satisfaction problem.