Gödel logic

From testwiki
Revision as of 14:25, 19 September 2024 by imported>Citation bot (Add: jstor, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Set theory | #UCB_Category 38/155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In mathematical logic, a Gödel logic, sometimes referred to as Dummett logic or Gödel–Dummett logic,[1] is a member of a family of finite- or infinite-valued logics in which the sets of truth values V are closed subsets of the unit interval [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics. The concept is named after Kurt Gödel.[2][3]

In 1959, Michael Dummett showed that infinite-valued propositional Gödel logic can be axiomatised by adding the axiom schema

(AB)(BA)

to intuitionistic propositional logic.[1][4]

See also

References

Template:Reflist

Template:Mathlogic-stub

Template:Set theory Template:Logic