Model theoretic formalization clarifies alkhwarizmi inheritance rules
A Model-Theoretic Formalization of AlKhwaremis ilm alfaraid
Logic in Computer ScienceComputation and Language
Summary
The paper translates ancient Islamic inheritance rules into precise mathematical language, showing that these rules can be represented and solved using known mathematical techniques. The authors prove that all valid inheritance divisions in their framework fit a standard structure, making the representation unique and consistent. They also connect this approach to broader methods for automating legal reasoning in Islamic law. This work helps computers understand and apply historic inheritance rules exactly.
What this means in practice
- •For legal software developers: Implement precise inheritance calculations in Islamic law software using the canonical algebraic model developed here.
- •For automated reasoning engineers: Design automated deduction systems for closed legal domains using the Horn clause axiomatization and terminating deduction methods described.
A theory result. No direct application yet.
Authors
Elnaserledinellah Mahmoud Abdelwahab
Abstract
This paper presents a model theoretic and computational formalization of AlKhwarizmis treatment of inheritance within the framework of Computational Fiqh. We first show that every inheritance configuration in a specified class is representable as a finite system of rational linear equalities and inequalities, and that such systems are decided exactly by Fourier Motzkin elimination over Q. We then define the fixed dimensional inheritance structure Vd with distinguished claimant coordinates, and prove that every admissible rational linear coordinate realization is isomorphic to Vd, this establishes the algebraic representation as canonical within that class. The complete first order theory Td of Vd is shown to be complete by construction and is explicitly distinguished from the decidability of the inheritance relevant fragment. The methodological principle is then related to a broader formalization of closed Fiqh domains via exhaustive case generation, Horn clause axiomatization, and terminating deduction, yielding domain relative computational completeness.