Provability or provable (and disprovability or disprovable) may refer to:
*
Provability logic Provability logic is a modal logic, in which the box (or "necessity") operator is interpreted as 'it is provable that'. The point is to capture the notion of a proof predicate of a reasonably rich formal theory, such as Peano arithmetic.
Examples ...
, a modal logic
*
Provable prime
In number theory, a provable prime is an integer that has been calculated to be prime number, prime using a primality-proving algorithm. Boot-strapping techniques using Pocklington primality test are the most common ways to generate provable prime ...
, an integer that has been calculated to be prime
*
Provable security
Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields.
Usually, this refers to mathematical proofs, which are common in cryptography. In such a proof, the capabilit ...
, computer system security that can be proved
*
Provably correct
In theoretical computer science, an algorithm is correct with respect to a specification if it behaves as specified. Best explored is ''functional'' correctness, which refers to the input–output behavior of the algorithm: for each input it produ ...
, correctness of an algorithm that can be proved
*
Provably total
Computable functions are the basic objects of study in computability theory. Informally, a function is ''computable'' if there is an algorithm that computes the value of the function for every value of its argument. Because of the lack of a precise ...
, function that can be proven to be computable
See also
*
Proof (disambiguation)
Proof most often refers to:
* Proof (truth), argument or sufficient evidence for the truth of a proposition
* Alcohol proof, a measure of an alcoholic drink's strength
Proof may also refer to:
Mathematics and formal logic
* Formal proof, a con ...
*
Proof theory
Proof theory is a major branchAccording to , proof theory is one of four domains mathematical logic, together with model theory, axiomatic set theory, and recursion theory. consists of four corresponding parts, with part D being about "Proof The ...
, a branch of mathematical logic
*
Recursively enumerable set
In computability theory, a set ''S'' of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if:
*There is an algorithm such that the ...
, also known as provable set
{{disambiguation