A Programming Language for the Inductive Sets, and Applications

We introduce a programming language IND that generalizes alternating Turing machines to arbitrary first-order structures. We show that IND programs (respectively, everywhere-halting IND programs, loop-free IND programs) accept precisely the inductively definable (respectively, hyperelementary, elementary) relations. We give several examples showing how the language provides a robust and computational approach to the theory of first-order inductive definability. We then show: (1) on all acceptable structures (in the sense of Moschovakis [Mo]), r.e. Dynamic Logic is more expressive than finite-test Dynamic Logic. This refines a separation result of Meyer and Parikh [MP]; (2) IND provides a natural query language for the set of fixpoint queries over a relational database, answering a question of Chandra and Harel [CH2].

[1]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[2]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[3]  Willem P. de Roever,et al.  A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..

[4]  Zohar Manna,et al.  The Correctness of Nondeterministic Programs , 1970, Artif. Intell..

[5]  Stephen A. Cook,et al.  Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..

[6]  Albert R. Meyer,et al.  Definability in Dynamic Logic , 1980, STOC '80.

[7]  David Harel,et al.  Horn clauses and the fixpoint query hierarchy , 1982, PODS.

[8]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[9]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[10]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[11]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[12]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[13]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[14]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[15]  Jerzy Tiuryn.  Unbounded program memory adds to the expressive power of first-order dynamic logic , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[16]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[17]  Joseph Y. Halpern.  On the Expressive Power of Dynamic Logic. II , 1981 .

[18]  Krzysztof R. Apt,et al.  A Cook's Tour of Countable Nondeterminism , 1981, ICALP.

[19]  Neil Immerman,et al.  Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[20]  Jerzy Tiuryn,et al.  A Note On Equivalences Among Logics of Programs , 1981, Logic of Programs.

[21]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[22]  Karl Winklmann,et al.  On the expressive power of Dynamic Logic (Preliminary Report) , 1979, STOC.