Satisfiability of bright formulas

Authors

  • A. S. Denisov

Abstract

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.

Published

25.10.2007

Issue

Section

Short communications