Open AccessOn equivalence of PFP-operator and PFP-quantifier
Author(s) -
Всеслав Станиславович Секорин
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1902/1/012085
Subject(s) - equivalence (formal languages) , quantifier (linguistics) , mathematics , operator (biology) , expressive power , fixed point , semantics (computer science) , discrete mathematics , algebra over a field , computer science , programming language , pure mathematics , artificial intelligence , mathematical analysis , biochemistry , chemistry , repressor , transcription factor , gene
In this paper we consider two different logic languages. Both of them are extensions of first order logic. The first semantics is obtained by adding a partial fixed point operator. The second semantics is based on considering a partial fixed point as a non-standard quantifier. For this two semantics we demonstrate that they have an equal expressive power. For this purpose we show how to express an arbitrary formula of one logic with a formula of another.