Design complete sequential calculus for continuous fixpoint temporal logic

Chapter 2 examines Ralph Ellison’s Invisible Man as a text that ekphrastically simulates a moving or “peristrephic” panorama in general, and an antebellum antislavery panorama in particular. In the process, this chapter reads Ellison’s debut novel as a text indebted to and allusive of, while ironically commenting on, the life and career of celebrated fugitive and peristrephic panoramist Henry Box Brown, who shipped himself in a sealed wooden crate from Richmond to Philadelphia and thus from slavery to freedom in 1849. Brown’s subsequent efforts to navigate the terrain of abolitionist discourse within a white supremacist culture led him to create a moving panorama called the Mirror of Slavery, which chronicled the cruelties of slavery, yet ended with the promise of universal emancipation. In appropriating the visual grammar of the antislavery panorama, Ellison also extends its ambivalent temporal logic to create his own alternative history in service of the future.

Download Full-text

Specification of Intelligent Controllers for Discrete Event Systems in a Temporal Logic Framework

IFAC Proceedings Volumes ◽

10.1016/s1474-6670(17)49868-5 ◽

1992 ◽

Vol 25 (20) ◽

pp. 237-242

Author(s):

Dan Ionescu ◽

Jing-Yue Lin ◽

Hyung Soo Hwang

Keyword(s):

Temporal Logic ◽

Discrete Event Systems ◽

Discrete Event ◽

Event Systems ◽

Intelligent Controllers

Download Full-text

Towards the Temporal Approach to Abstract Data Types

Fundamenta Informaticae ◽

10.3233/fi-1988-11105 ◽

1988 ◽

Vol 11 (1) ◽

pp. 49-63

Author(s):

Andrzej Szalas

Keyword(s):

Temporal Logic ◽

Abstract Data Types ◽

Data Types ◽

First Order ◽

Abstract Data ◽

Order Completeness ◽

General Method

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.

Download Full-text