A slight strengthening of a theorem of Blair and Kunen

DOI10.1016/0304-3975(92)90393-TzbMath0769.68012OpenAlexW2007186638MaRDI QIDQ1193866

Kees Doets

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90393-t

zbMATH Keywords

fixed pointconsequence operatorlogic programco-computabilitytheorem of Blair and Kunen

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Left termination turned into termination
• The recursion-theoretic complexity of the semantics of predicate logic as a programming language
• Negation in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A slight strengthening of a theorem of Blair and Kunen