Satisfiability of bright formulas
We investigate one solvable subclass of quantified formulas in pure predicate calculus and obtain a necessary and sufficient condition for the satisfiability of formulas from this subclass.
Saved in:
| Date: | 2007 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Russian English |
| Published: |
Institute of Mathematics, NAS of Ukraine
2007
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/3401 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |