Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Intuitionistic logic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Various systems of symbolic logic}} '''Intuitionistic logic''', sometimes more generally called '''constructive logic''', refers to systems of [[symbolic logic]] that differ from the systems used for [[classical logic]] by more closely mirroring the notion of [[constructive proof]]. In particular, systems of intuitionistic logic do not assume the [[law of excluded middle]] and [[double negation elimination]], which are fundamental [[inference rules]] in classical logic. Formalized intuitionistic logic was originally developed by [[Arend Heyting]] to provide a formal basis for [[Luitzen Egbertus Jan Brouwer|L. E. J. Brouwer]]'s programme of [[intuitionism]]. From a [[proof-theoretic]] perspective, Heyting’s calculus is a restriction of classical logic in which the law of excluded middle and double negation elimination have been removed. Excluded middle and double negation elimination can still be proved for some propositions on a case by case basis, however, but do not hold universally as they do with classical logic. The standard explanation of intuitionistic logic is the [[BHK interpretation]].{{sfn|Van Atten|2022}} Several systems of semantics for intuitionistic logic have been studied. One of these semantics mirrors classical [[Boolean-valued semantics]] but uses [[Heyting algebra]]s in place of [[Boolean algebra]]s. Another semantics uses [[Kripke semantics|Kripke models]]. These, however, are technical means for studying Heyting’s deductive system rather than formalizations of Brouwer’s original informal semantic intuitions. Semantical systems claiming to capture such intuitions, due to offering meaningful concepts of “constructive truth” (rather than merely validity or provability), are [[Kurt Gödel]]’s [[dialectica interpretation]], [[Stephen Cole Kleene]]’s [[realizability]], Yurii Medvedev’s logic of finite problems,{{sfn|Shehtman|1990}} or [[Giorgi Japaridze]]’s [[computability logic]]. Yet such semantics persistently induce logics properly stronger than Heyting’s logic. Some authors have argued that this might be an indication of inadequacy of Heyting’s calculus itself, deeming the latter incomplete as a constructive logic.{{sfn|Japaridze|2009}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)