Every incomplete computably enumerable truth-table degree is branching.

Peter A. Fejer Richard A. Shore

Published in: Arch. Math. Log. (2001)

Keyphrases

truth table
defeasible logic
boolean functions
inductive inference
search algorithm
special case
hypothesis space
logic programming
business processes