Open AccessNormal form of formulas of pure hybrid logic
Author(s) -
Daiva Aleknavičiūtė,
Stanislovas Norgėla
Publication year - 2021
Publication title -
lietuvos matematikos rinkinys
Language(s) - English
Resource type - Journals
eISSN - 2335-898X
pISSN - 0132-2818
DOI - 10.15388/lmr.2007.24225
Subject(s) - satisfiability , operator (biology) , scope (computer science) , mathematics , algebra over a field , boolean satisfiability problem , discrete mathematics , calculus (dental) , computer science , pure mathematics , programming language , medicine , chemistry , dentistry , repressor , gene , biochemistry , transcription factor
In this paper,we study a transformationof pure hybrid logic formulae,which do not have binding operator, into an equivalent normal form, which does not have any satisfiability operators in the scope of another satisfiability operator.