Logic Programming and Effectively Closed Sets

DOI10.1142/9789813228238_0006MaRDI QIDQ4993083zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Wiktor Marek, Jeffrey Remmel

Publication date 15 June 2021

Published in Structure and Randomness in Computability and Set Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789813228238_0006

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• On the complexity of index sets for finite predicate logic programs which allow function symbols
• Index sets for finite normal predicate logic programs with function symbols
• The Stable Models of a Predicate Logic Program
• How complicated is the set of stable models of a recursive logic program?
• Locally determined logic programs and recursive stable models

Cited in

(2)

• scientific article; zbMATH DE number 1140683 (Why is no real title available?)
• Logic programming with infinite sets

This page was built for publication: Logic Programming and Effectively Closed Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993083)