Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
