Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with higher-order-logic
Search options answers only
not deleted
user 75
Use this tag for questions related to higher order logic. Do not use this tag with the HOL theorem prover instead use hol. Do not use this tag for Isabelle/HOL instead use isabelle-hol. Do not use this tag with HOL light theorem prover instead use hol-light.
10
votes
Accepted
Is ACL2 first-order-logic and is this a limitation for proving math?
ACL2 supports well-founded induction up to, but not including $\epsilon_0$. So you cannot prove consistency of (first order) arithmetic, whereas in higher order logic you can (type :doc ordinals in th …
- 2,330
13
votes
What are the bases for different Proof Assistants?
ACL2 is based on the logic of Common Lisp. This means several things:
The universe (over which one quantifies and defines predicates) consists of the s-expressions.
Logically, it is equivalent to fin …
- 2,330