The Algorithm of Islamic Jurisprudence (Fiqh) with Validation of an Entscheidungsproblem

TL;DR

This paper introduces a formal algorithmic framework for Islamic jurisprudence (Fiqh) using mathematical logic and computer science, aiming to enhance transparency, legal security, and accountability in Islamic law.

Contribution

It develops a generic algorithm for deciding Fiqh rulings based on First Order Logic, formalizing Fiqh methodology and validating an Entscheidungsproblem for these systems.

Findings

Formal logic structure for Fiqh established

Algorithmic decision procedure for Fiqh rulings created

Analysis of completeness, decidability, and complexity conducted

Abstract

The historic background of algorithmic processing with regard to etymology and methodology is translated into terms of mathematical logic and Computer Science. A formal logic structure is introduced by exemplaryquestions posed to Fiqh-chapters to define alogic query language. As a foundation, ageneric algorithm for deciding Fiqh-rulings is designed to enable and further leverage rule of law (vs. rule by law) with full transparency and complete algorithmic coverage of Islamic law eventually providing legal security, legal equality, and full legal accountability.This is implemented by disentangling and reinstating classic Fiqh-methodology (usul al-Fiqh) with the expressive power of subsets of First Order Logic (FOL)sustainably substituting ad hoc reasoning with falsifiable rational argumentation. The results are discussed in formal terms of completeness, decidability and complexity of formal Fiqh-systems. AnEntscheidungsproblem for formal Fiqh-Systems is formulated and validated.