Article ID Journal Published Year Pages File Type
4662921 Journal of Applied Logic 2013 28 Pages PDF
Abstract

Ordinary dynamic action logics deal with states and actions upon states. The actions can be deterministic or non-deterministic, but it is always assumed that the possible results of the actions are clear cut.Talmudic logic deals with actions (usually legally meaningful actions which can change the legal status of an entity) which depend on the future and therefore may be not clear cut at the present and need future clarifications.The clarification is modelled by public announcement which comes at a later time after the action has taken place.The model is further complicated by the need to know what is the status of formulas at a time before the results of the action is clarified, as we do not know at which state we are in. Talmudic logic treats such states much like the quantum superposition of states and when clarification is available we get a collapse onto a pure state.The Talmudic lack of clarity of actions arises from applying an action to entities defined using the future, like the statement of a dying man on his death bed: Let the man who will win the jackpot in the lottery next week be the sole heir in my will now We need to wait a week for the situation to clarify.There is also the problem of legal backwards causality, as this man, if indeed he exists, unaware of his possible good fortune, may have himself meanwhile donated all his property to a charity. Does his donation include this unknown inheritance?This paper will offer a model and a logic which can represent faithfully the Talmudic reasoning in these matters.We shall also see that we get new types of public announcement logics and (quantum-like) action logics. Ordinary public announcement logic deletes possible worlds after an announcements. Talmudic public announcement logic deletes accessibility links after an announcement. Technically these two approaches are similar but not equivalent.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Logic
Authors
, , , ,