Peter Roosen-Runge

319 Calumet College, York University,
North York M3J 1P3, Ont., Canada

Ph: 416-736-2100, ext. 77844, Fax 416-736-5924,
e-mail: peter at cse.yorku.ca

mug

Photos of York computing -- 1973

Recent Teaching :

CSE 3341 .03 M Introduction to Program Verification.

Recent work:

Other projects:


Ancient Work:

An Algebraic Description of Access and Control in Information-Processing Systems, University Microfilms: 1967.
Presents fundamental results on the application of lattice theory to mereology, information flow among parts of a system, and the duality of transmission and control.
Chapter I - Introduction
Chapter II - Decompositions
Chapter III - Localization of Information
Chapter IV - Basic Structure of a Computer and the Concept of Control
Chapter V - Ranges and Domains of Instructions; Prediction and Transmission
Chapter VI - Access, Access Structures, and the Concept of Stored Program
Appendices, List of Symbols, List of References

"The algebra of distributionally defined classes", Cahiers de linguistique theorique et applique, 10, Fasc. 1, 1973.

Intended in some ways as an "homage" to Rulon Wells and immediate constituent analysis, which had become, perhaps undeservedly, a dead-end in linguistic research with the rise of transformational grammar.

Philosophical preoccupations:

Mathematical holism

Metaphysical lattices (Powerpoint)

Tractarian semantics

Berry's Paradox

Intention and backward-chaining in Plato's Philebus

From Behavior to Structure: construction of a minimal specification of internal causal structure (state-transition function) from a specification of external behavior (I/O mapping) for a very general class of finite or infinite transducers, using the lattice of behavioral congruences. (A reworking of the Myhill-Nerode and Scott-Rabin theorems in very general terms.)

Boolean Propositions aren't Truth-Functional

Who's On First?

What Propositions Aren't

Miscellaneous:

"Liddle Alice"



Up to Computer Science Home Page

Last Updated: December 10, 2009