The unification problem in a propositional logic is to determine, given formula φ, whether there exists substitution σ such that σ(φ) logic. In case, unifier of φ. When unifiable has minimal complete sets unifiers, it either infinitary, finitary, or unitary, depending on the cardinality its unifiers. Otherwise, nullary. this paper, we prove modal $\mathbf {K}+\square \square \bot $ , formulas a...

Generation of a quasi-contractive semigroup by generalized Ornstein-Uhlenbeck operators ℒ = −∆ + ∇Φ · ∇ − G V c|x|−2 in the weighted space L2(RN, e−Φ(x)dx) is proven, where Φ ∈ C2(RN, R), C1(RN, RN), 0 ≤ C1(RN) and c > 0. The proofs are carried out an application L2-weighted Hardy inequality bilinear form techniques.