A programming language for the inductive sets, and applications

DOI10.1016/S0019-9958(84)80045-5zbMath0591.68037OpenAlexW1997804367MaRDI QIDQ3719820

Dexter Kozen, David Harel

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80045-5

zbMATH Keywords

databasealternating Turing machinesfirst-order structuresacceptable structuresfinite-test dynamic logicfirst-order inductive definabilityquery language for the set of fixpoint queries over a relationalquery language for the set of fixpoint queries over a relational databaser.e. dynamic logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Information storage and retrieval of data (68P20) Inductive definability (03D70)

Related Items (10)

Differential Game Logic ⋮ Concurrent program schemes and their logics ⋮ Communication in concurrent dynamic logic ⋮ Computational inductive definability ⋮ Descriptive characterizations of computational complexity ⋮ The dimension of the negation of transitive closure ⋮ How to Compute Antiderivatives ⋮ Well-founded coalgebras, revisited ⋮ Halting and Equivalence of Program Schemes in Models of Arbitrary Theories ⋮ A logic of recursion

This page was built for publication: A programming language for the inductive sets, and applications