论文信息 - A Proof System for the First-Order Relational Calculus - 字舞流文

A Proof System for the First-Order Relational Calculus

Abstract A consistent and complete proof system is given for the first-order relational calculus. The system is based on the Analytic Tableaux method for first-order predicate calculus. The compactness theorem for the system is then derived.

Matthew Hennessy

[1] Willem P. de Roever,et al. A Calculus for Recursive Program Schemes , 1972, ICALP.

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

[3] W. P. deRoever. Operational, mathematical and axiomatized semantics for recursive procedures and data structures , 1974 .

[4] Matthew C. B. Hennessy. A formal approach to the study of parameter passing mechanisms and non-determinism. , 1976 .

[5] W. W. Wadge,et al. A Complete Natural Deduction System for the Relational Calculus , 1975 .

[6] R. Smullyan. First-Order Logic , 1968 .

[7] Assaf J. Kfoury,et al. On the Termination of Program Schemas , 1975, Inf. Control..

[8] Peter Hitchcock. An approach to formal reasoning about programs , 1974 .

[9] R. Lyndon. THE REPRESENTATION OF RELATIONAL ALGEBRAS , 1950 .