A decision procedure for arbitrary first-order formulas can be viewed as combining a propositional search with a decision procedure for conjunctions of first-order literals, so Boolean SAT methods can be used for the propositional search in order to improve the performance of the overall decision procedure. We show how to combine some Boolean SAT methods with non-clausal heuristics developed fo...

We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final c...

In this paper, we show that an $L_1$-2-type surface in the three-dimensional hyperbolic space $H^3subset R^4_1$ either is an open piece of a standard Riemannian product $ H^1(-sqrt{1+r^2})times S^{1}(r)$, or it has non constant mean curvature, non constant Gaussian curvature, and non constant principal curvatures.