@article {DK\&N, title = {Embedding and Interpolation for Some Paralogics. {T}he Propositional Case}, journal = {Reports on Mathematical Logic}, volume = {33}, year = {1999}, pages = {29{\textendash}44}, abstract = {

We consider the very weak paracomplete and paraconsistent logics that are obtained by a straightforward weakening of Classical Logic, as well as some of their maximal extensions that are a fragment of Classical Logic. We prove (for the propositional case) that these logics may be faithfully embedded in Classical Logic (as well as in each other), and that the interpolation theorem obtains for them.

}, author = {Batens, Diderik and De Clercq, Kristof and Kurtonina, Natasha} } @article {Kurtonina:1997:BTL:595833.595898, title = {Bisimulations for Temporal Logic}, journal = {Journal of Logic, Language and Information}, volume = {6}, number = {4}, year = {1997}, pages = {403{\textendash}425}, abstract = {

We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.

}, keywords = {definability, expressive power, modal and temporal logic, model theory}, issn = {0925-8531}, doi = {10.1023/A:1008223921944}, author = {Kurtonina, Natasha and De Rijke, Maarten} } @article {184851, title = {Simulating without negation.}, journal = {Journal of logic and computation}, volume = {7}, number = {4}, year = {1997}, pages = {501{\textendash}522}, abstract = {

Although negation-free languages are widely used in logic and computer science, relatively little is known about their expressive power. To address this issue we consider kinds of non-symmetric bisimulations called directed simulations, and use these to analyse the expressive power and model theory of negation-free modal and temporal languages. We first use them to obtain preservation, safety and definability results for a simple negation-free modal language. We then obtain analogous results for stronger negation-free languages. Finally, we extend our methods to deal with languages with non-Boolean negation. Keywords: Expressive power, modal logic, negation-free languages.

}, issn = {0955-792X}, author = {Kurtonina, Natasha and De Rijke, Maarten} }