ON THE COMPUTING POWER OF PROGRAMS WITH SETS

DOI10.1142/S0129054192000115zbMATH Open0754.68051OpenAlexW2034004280MaRDI QIDQ4020486FDOQ4020486

Authors: Alexei P. Stolboushkin 

Publication date: 16 January 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 4189706
• On computability and tractability for infinite sets
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• Hereditarily-finite sets, data bases and polynomial-time computability
• scientific article

zbMATH Keywords

data complexitycomputability over abstract structuresglobal predicatessemi-universal classes

Mathematics Subject Classification ID

Data structures (68P05) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory (03D99)

Cited In (7)

• Efficient HEX-Program Evaluation Based on Unfounded Sets
• On computability and tractability for infinite sets
• On the complexity of identifying head-elementary-set-free programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a computation system based on set theory
• Title not available (Why is that?)

This page was built for publication: ON THE COMPUTING POWER OF PROGRAMS WITH SETS

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