Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
We show that more head-driven parsing algorithms can he formulated than those occurring in the existing literature. These algorithms are inspired by a family of left-to-right pars...
We present a result which is obtained by combining a result of Carlson with the Finitary Dual Ramsey Theorem of Graham-Rothschild. We start by introducing some notation. We confor...
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...