The following pages link to (Q4029601):
Displaying 15 items.
- Computing with infinitary logic (Q672337) (← links)
- Bounded nondeterminism of logic programs (Q702093) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Semantics of infinite tree logic programming (Q1090469) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
- Completions of perpetual logic programs (Q1193890) (← links)
- Solving problems on finite concrete logics with the help of a PC (Q1266019) (← links)
- Finite generation and presentation problems for lambda calculus and combinatory logic (Q2151418) (← links)
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
- (Q3221399) (← links)
- Top-down semantics of fair computations of logic programs (Q3721791) (← links)
- Tight, consistent, and computable completions for unrestricted logic programs (Q4036289) (← links)
- (Q4325363) (← links)
- (Q4364389) (← links)
