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 automated-theorem-proving
Search options answers only
not deleted
user 47300
For questions related to the automation of mathematical theorem proving, including rules systems, the acquisition of predicate logic and inference by deep networks, combinations of these, or novel new designs and supporting algorithms.
3
votes
Can a computer make a proof by induction?
There are programming languages that allow you to verify a proof by induction. For example, I used Coq, but I'm sure there are also others.
- 51