Pages that link to "Item:Q2804944"
From MaRDI portal
The following pages link to Inductive completeness of logics of programs (Q2804944):
Displaying 8 items.
- Inductive expansion: A calculus for verifying and synthesizing functional and logic programs (Q757077) (← links)
- An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781) (← links)
- On the Completeness of Dynamic Logic (Q3617722) (← links)
- (Q3722485) (← links)
- (Q4218844) (← links)
- Well-definedness and observational equivalence for inductive–coinductive programs (Q5225850) (← links)
- Reasoning About Incompletely Defined Programs (Q5387856) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)