UNSPECIFIED (1997) Simulating without negation. JOURNAL OF LOGIC AND COMPUTATION, 7 (4). pp. 501-522. ISSN 0955-792X

Full text not available from this repository.

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title:	JOURNAL OF LOGIC AND COMPUTATION
Publisher:	OXFORD UNIV PRESS
ISSN:	0955-792X
Date:	August 1997
Volume:	7
Number:	4
Number of Pages:	22
Page Range:	pp. 501-522
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/16436

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item