Apology in Law: Theoretical Foundations for Reform of Apology Law in Professional Negligence and Misconduct
Bibliographic record
Abstract
Apology occupies an increasingly significant role in contemporary legal discourse, bridging the domains of moral responsibility, psychological healing, and professional accountability. Yet, in Malaysia, the absence of statutory protection for apology renders it legally perilous—discouraging professionals from expressing remorse or acknowledging fault for fear of self-incrimination. This paper advances a theoretical justification for protecting admission by apologetic discourse, situating the argument within five complementary frameworks: Therapeutic Jurisprudence, Rational Choice Theory, Game Theory, Empathy Theory, and Attribution Theory. Adopting a doctrinal and interdisciplinary approach, this study analyses the nexus between law, psychology, and behavioural economics to demonstrate how apology functions as both a restorative and preventive mechanism. Comparative models from Australia, Canada, and the United Kingdom reveal that apology laws reduce litigation, improve professional integrity, and enhance public confidence. The paper argues that a theory-driven legislative framework would harmonise Malaysia’s evidentiary and professional standards with global trends, transforming apology into a legally protected instrument of reconciliation, emotional repair, and systemic efficiency.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.009 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.004 | 0.042 |
| Scholarly communication | 0.008 | 0.010 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.006 | 0.005 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".