The Handling of Loops in Talmudic Logic, with Application to Odd and Even Loops in Argumentation.

In this paper we present the notion of the TalmudicShkop extension to an abstract argumentation network (S,R) and compare it with Baroni’sand his colleagues CF2 extensions and with Gabbay’s Equational approach to CF2 semantics.We also offer tableaux methods as well as discuss temporal stamping of arguments and their use in resolving loops