We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...