论文信息 - Completeness of a relational calculus for program schemes - 字舞流文

Completeness of a relational calculus for program schemes

The relational calculus MU/sub 2/, presented in de Roever's dissertation as a framework for describing and proving properties of programs, was conjectured by David Park to be complete. In this paper we confirm Park's conjecture.

Marcelo F. Frias | Roger D. Maddux | R. Maddux | M. Frias

[1] Alfred Tarski,et al. Relational selves as self-affirmational resources , 2008 .

[2] Marcelo F. Frias,et al. Fork Algebras in Algebra, Logic and Computer Science , 2002, Fundam. Informaticae.

[3] Bjarni Jónsson. Relation algebras and Schröder categories , 1988, Discret. Math..

[4] B. Jónsson. Varieties of relation algebras , 1982 .

[5] Willem P. de Roever,et al. Recursive program schemes: semantics and proof theory , 1976, Mathematical Centre Tracts.

[6] A. Tarski,et al. A Formalization Of Set Theory Without Variables , 1987 .

[7] A. Tarski,et al. Boolean Algebras with Operators , 1952 .

[8] Roger D. Maddux,et al. Some sufficient conditions for the representability of relation algebras , 1978 .

[9] A. Tarski. Contributions to the theory of models. III , 1954 .