On the calculus of positively constructed formulas for authomated theorem proving
The paper deals with an expressive logic language LF and its calculus. Formulas of this language consist of some large-block structural elements, such as type quanti¯ers. The language LF contains only two logic symbols for any and is, which form the set of logic connectives of the language. A logic...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2010-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1052 |