Cancellation laws for polynomial-time \(p\)-isolated sets

DOI10.1016/0168-0072(92)90071-7zbMath0772.03022OpenAlexW2077080157MaRDI QIDQ1192348

John N. Crossley, Jeffery B. Remmel

Publication date: 27 September 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(92)90071-7

zbMATH Keywords

isols\(p\)-isolated set\(p\)-time equivalence typecombinatorial operatorpolynomial-time equivalence typeuniversal Horn sentence

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive equivalence types of sets and structures, isols (03D50)

Cites Work

• Extensions to isols
• Recursive equivalence types and combinatorial functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cancellation laws for polynomial-time \(p\)-isolated sets