Pages that link to "Item:Q3043128"
From MaRDI portal
The following pages link to The recursion-theoretic complexity of the semantics of predicate logic as a programming language (Q3043128):
Displaying 10 items.
- A slight strengthening of a theorem of Blair and Kunen (Q1193866) (← links)
- Equivalence-preserving first-order unfold/fold transformation systems (Q1200980) (← links)
- Definite clause programs are canonical (over a suitable domain) (Q1356204) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
- Truth versus information in logic programming (Q2933087) (← links)
- Sémantique logique et dénotationnelle des interpréteurs PROLOG (Q3798220) (← links)
- An equivalence preserving first order unfold/fold transformation system (Q5096195) (← links)
- On logical constraints in logic programming (Q5101440) (← links)
- Game characterizations of logic program properties (Q5101444) (← links)