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
HOL (proof assistant)
(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!
==Underlying logic== {{expand section|date=October 2021}} HOL systems use variants of [[classical logic|classical]] [[higher-order logic]], which has simple axiomatic foundations with few axioms and well-understood semantics.<ref>{{cite book|last=Andrews|first=Peter B|year=2002|title=An introduction to mathematical logic and type theory: to truth through proof|edition=Second|series=Applied Logic Series|volume=27|isbn=978-1-4020-0763-7|publisher=Kluwer Academic Publishers|location=Dordrecht}}</ref> The logic used in HOL provers is closely related to Isabelle/HOL,<ref>{{cite book|author1=Tobias Nipkow|author2=Markus Wenzel|author3-link=Lawrence C. Paulson|author3=Lawrence C. Paulson|year=2002|title=Isabelle/HOL: A Proof Assistant for Higher-Order Logic|publisher=Springer-Verlag|location=Berlin, Heidelberg|isbn=978-3-540-45949-1|author1-link=Tobias Nipkow}}</ref> the most widely used logic of [[Isabelle (proof assistant)|Isabelle]].
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)