証明可能性論理
1. Provability logicProvability 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. There are a number of provability logics, some of which are covered in the literature mentioned in the References section. The basic system is generally referred to as GL or L or K4W.
Read “Provability logic” on English Wikipedia
Read “証明可能性論理” on Japanese Wikipedia
Read “Provability logic” on DBpedia
Read “Provability logic” on English Wikipedia
Read “証明可能性論理” on Japanese Wikipedia
Read “Provability logic” on DBpedia
Discussions
Log in to talk about this word.