Skip to main navigation Skip to search Skip to main content

Obligations and prohibitions in Talmudic deontic logic

  • King's College London
  • University of Luxembourg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

This paper examines the deontic logic of the Talmud. We shall find, by looking at examples, that at first approximation we need deontic logic with several connectives: OTA Talmudic obligation FTA Talmudic prohibition FDA Standard deontic prohibition ODA Standard deontic obligation. In classical logic one would have expected that deontic obligation OD is definable by - ODA ≡ FD ¬A and that OT and FT are connected by - O TA ≡ FT ¬A This is not the case in the Talmud for the T (Talmudic) operators, though it does hold for the D operators. We must change our underlying logic. We have to regard {OT, FT} and {OD, FD} as two sets of operators , where O T and FT are independent of one another and where we have some connections between the two sets. We shall list the types of obligation patterns appearing in the Talmud and compare Talmudic Logic with modern deontic logic.

Original languageEnglish
Title of host publicationDeontic Logic in Computer Science - 10th International Conference, DEON 2010, Proceedings
Pages166-178
Number of pages13
DOIs
StatePublished - 2010
Event10th International Conference on Deontic Logic in Computer Science, DEON 2010 - Fiesole, Italy
Duration: 7 Jul 2010 → 9 Jul 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6181 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Deontic Logic in Computer Science, DEON 2010
Country/TerritoryItaly
CityFiesole
Period7/07/10 → 9/07/10

Fingerprint

Dive into the research topics of 'Obligations and prohibitions in Talmudic deontic logic'. Together they form a unique fingerprint.

Cite this