Pith. sign in

REVIEW 3 major objections 5 minor 18 references

Judicial Permission

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper characterizes judicial permission — the weak permission a criminal trial produces when no norm or precedent settles an act's status — as a purely procedural outcome: an act is permitted exactly when the dialogue game modeling…

desk verdict Plausible idea for formalizing judicial permission in dialogues, but the formal state omits facts and the inclusion direction looks reversed. read the letter →

arxiv 2506.04610 v1 pith:DRBK62CH submitted 2025-06-05 cs.AI cs.CYcs.LO

Guido Governatori , Antonino Rotolo This is my paper
classification cs.AIcs.CYcs.LO
keywords weakpermissionjudicialcriminalproceduredefeasibledeonticlogicdialoguegamesstandardsofproofargument
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that judicial permission — a weak permission that arises in a criminal trial when no explicit norm or precedent settles whether an action is allowed — can be characterized entirely in procedural terms. Modelling a criminal trial as a dialogue game in which prosecution and defence alternately add rules from their private knowledge to a shared theory, the paper claims that an action is judicially permitted exactly when the dialogue terminates with the shared theory failing to prove the obligation of the negation of that action, under the applicable standard of proof. The account is deliberately restricted to the sceptical proof standards (ambiguity blocking and ambiguity propagation), because for those standards the logic guarantees that an obligation and its negation cannot both be proved. If the characterization is correct, judicial permission is not a separate legal fact but a negative proof outcome, giving the principle of legality — everything not shown to be prohibited is permitted — a precise procedural meaning.

What carries the argument

The central object is the criminal-proceeding dialogue game of Definition 4.1, a finite alternating sequence in which the prosecution must prove both the evidential claim (+δ a for each fact a) and the deontic claim (+# O∼a at the specified standard), while the defence can refute either, and the game terminates when one party runs out of private rules and fails to maintain its claims. The load-bearing identity is Definition 5.3, which equates #-weak permission with the failure to prove the opposite obligation, −# O∼l, together with Proposition 5.1, which guarantees that for # ∈ {δ, ∂} an obligation and its negation cannot both be proved. The proof tags +δ (ambiguity propagation) and +∂ (ambiguity blocking) serve as the standards of proof: the former is mapped to 'beyond reasonable doubt' and the latter to 'preponderance of evidence', and the dialogue game keeps the standard for evidential claims fixed at +δ while letting deontic rules carry their own standards.

What would settle it

Take a defeasible theory with facts a and b and rules a ⇒ x, b ⇒ ¬x, x ⇒ p, with no rule for ¬p. Under the standard reading of defeasible logic, x is ambiguous: with ambiguity blocking, x is not provable and hence p is not provable (+∂ p fails), while with ambiguity propagation, x is carried to p (+δ p holds). Constructing this theory so that it satisfies the paper's conditions (acyclic superiority relation, no opposite obligation facts) would directly refute Proposition 3.1(1), and with it the ordering of proof standards that Definition 5.4 relies on.

Watch

Extended reading notes

Core claim

The paper's central claim is Definition 5.4, which states that in any criminal-proceeding dialogue game D with deontic claims ClaimO = {O∼$\ell^1$, ..., O∼ln} and # ∈ {δ, ∂}, a literal lk is #-weakly permitted in D iff D terminates at a turn i and the shared theory at that turn D_{i-1} does not prove the obligation of the negation of lk, that is, D_{i-1} ⊢ −# O∼lk. This follows from Definition 5.3, which defines #-weak permission for any defeasible theory as the absence of a proof of the opposite obligation, together with Proposition 5.1, which shows that for sceptical standards a theory cannot prove both O l and O∼l when the superiority relation is acyclic and the facts contain no deontic conflicts. The paper reads the dialogue-game outcome accordingly: if the prosecution succeeds, no claimed action is weakly permitted; if the defence succeeds, every claimed action is weakly permitted.

Load-bearing premise

The paper assumes, without proving it, that a claim proved with the ambiguity-propagation standard is also proved with the ambiguity-blocking standard, so that the proof standards are ordered from strongest to weakest; if this ordering is wrong, the mapping of standards to legal proof thresholds and the characterization of judicial permission built on it would need to be reworked.

Editorial extensions

If this is right

  • In a criminal-proceeding dialogue game, whether an action is judicially permitted is settled by the procedural outcome: if the defence succeeds, every action in the prosecution's claim is weakly permitted; if the prosecution succeeds, none are.
  • Judicial permission can be defined without introducing any new permission rule or norm: it is simply the negative deontic conclusion −# O∼l at the standard of proof used in the game.
  • The distinction between sceptical and credulous standards is decisive: for the sceptical standards # ∈ {δ, ∂} the characterization works because an obligation and its negation cannot both be proved; for credulous standards (σ, σ−) conflicting obligations can coexist, so no clean permission verdict is available.
  • The burden of proof configuration — prosecution must prove both the evidential and deontic elements of the charge — gives weak permission a natural home in adversarial procedure: the defence wins by exhausting the prosecution's private rules and blocking either type of claim.
  • The principle of legality (nullum crimen sine lege) is given a formal reading: any act whose prohibition is not proved at the applicable standard is permitted within the dialogue, provided the game terminates in favour of the defence.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If Definition 5.4 is correct, judicial permission is a procedural artifact: the same criminal code could yield different permissions depending on the standard of proof assigned to deontic rules and on which party's private rules are exhausted first. An empirical test would be to run the dialogue game on actual criminal codes with varied rule sets and see whether the resulting permissions match jud
  • The paper restricts the characterization to sceptical standards and leaves credulous standards open; a natural extension would be to modify the dialogue game so that the prosecution must defeat the strongest defence argument under credulous semantics, and to check whether a 'clear and convincing' or 'dialectical validity' standard can be captured by a different proof tag.
  • The paper's proof-standard hierarchy rests on a non-standard ordering of the two defeasible-logic proof tags; if the standard ordering from the literature were used, the mapping of tags to legal standards would have to be checked, though the negative-proof characterization of permission would survive.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes a formal dialogue-game model of judicial permission in criminal trials, built on defeasible deontic logic (DDL). It defines a criminal-proceeding dialogue game in which the prosecution and the defence exchange private rules under various proof standards, and it introduces a notion of #-weak permission, intended to capture when an act is weakly permitted because the theory at the end of the game fails to prove the obligation of its negation. The paper also states a few deontic consistency results and positions the work against the existing literature on argument games, proof standards, and DDL.

Significance. If the formal model were sound, the paper would offer a useful bridge between proof standards in criminal procedure, argumentation games, and deontic logic, and it would give a precise logical meaning to 'judicial permission'. The legal motivation is genuinely important, and the authors are well placed to make this connection. However, the current formalization has a blocking omission: the game state in Definition 4.1 omits the fact base, so the game cannot start. In addition, the central 'characterization' in Definition 5.4 is stipulated rather than derived. As a result, the contribution is not yet established, although the underlying idea seems repairable.

major comments (3)
  1. [Section 4, Definition 4.1] The state of the game is declared to be a defeasible theory D_i=(R^i_Com,>), but Section 3 defines a defeasible theory as a triple (F,R,>), and Section 2's running example uses an explicit fact set F={a,d,f,g}. Because no F appears in D_i and the update rule only adds rules to R_Com, no rule with a non-empty antecedent is ever applicable; consequently the turn-0 condition D_0⊢+δ a_k and D_0⊢+#O∼a_k cannot hold for any non-trivial claim. The game cannot start, and Definition 5.4 has no non-vacuous instances. The fix is straightforward: include the common fact base F in D_0 and in every D_i, and carry it through the updates.
  2. [Section 5, Definition 5.4] The 'characterization' of #-weak permission in a dialogue game is true by construction rather than derived. The right-hand side (D terminates at turn i and D_{i-1}⊢−#O∼l_k) is exactly condition (a) of the Def-succeeds case in Definition 4.1. The paper therefore does not prove that dialogue success characterizes judicial permission; it stipulates that it does. The authors should either present this as an explicit modeling choice and argue for its adequacy, or prove a theorem showing that the dialogue game's successful defenses coincide with the theory-level weak-permission relation under independently motivated rules.
  3. [Section 4, Definition 4.1] The informal description in Section 2 says that each turn consists of putting forward an argument or passing, but the formal definition contains no pass move. As written, the only moves are 'Pr plays R_i' or 'Def plays R_i' with R_i a subset of the player's private rules, so the termination condition R^{i-1}_Pr=∅ or R^{i-1}_Def=∅ can only be reached by a player exhausting all private rules, not by conceding. In addition, the conditions on the chosen set {l_1,...,l_k} after a move are given as a disjunction of alternatives with no indication of whether these are case distinctions on the role of l_j or separate sufficient conditions; this makes the set of legal moves underdetermined.
minor comments (5)
  1. [Section 3, proof-standard list] The bullet 'l is proved in D with proof standard beyond reasonable doubt iff D⊢+δ l' appears twice in the list; one occurrence should be deleted.
  2. [Section 3, Proposition 3.1] For the record, Proposition 3.1(1) is not reversed relative to the standard inclusion theorem: ambiguity propagation is the more cautious variant, so +δ⊆+∂ is the direction that matches the proof-standard ordering in Definition 3.2. However, the proof tags are used without defining the underlying proof theory; a brief definition or a precise pointer to the relevant theorem in [4,8] would improve self-containedness.
  3. [Section 4, Definition 4.1] The set of literals {l_1,...,l_k} chosen by a player is not explicitly connected to Claim_F or Claim_O; clarify whether the l_j are required to be the claim literals a_k or may be arbitrary intermediate conclusions.
  4. [Sections 4–5] Definition 4.1 allows # to range over {δ,∂,σ,σ−}, but Definitions 5.3 and 5.4 restrict # to {δ,∂}; the paper should explain why the credulous standards σ and σ− are excluded from the permission characterization even though they appear in the dialogue game.
  5. [Introduction] The sentence 'such as Strong Permission and Weak Permission (see [17, 18].' is missing a closing parenthesis.

Circularity Check

1 steps flagged · score 6.0 of 10

The formal characterization of judicial permission in dialogue games (Def. 5.4) is a definitional restatement of the game's own termination condition (Def. 4.1) plus the DDL weak-permission predicate (Def. 5.3), so the central result reduces to its inputs by construction.

  1. self definitional [Section 5, Definition 5.4 (with Definition 4.1 termination rule)]
    "Definition 5.4. Let D be any criminal-proceeding dialogue game where ClaimO ={ O∼l1,..., O∼ln} and # ∈{δ,∂}. Any literal lk, 1≤k≤n, is #-weakly permitted in D iff • D terminates at turn i; • Di−1⊢−# O∼lk."

    The defining condition is already present in Definition 4.1's termination rule: 'Def succeeds: R^{i-1}_Pr = ∅ and there is any a_k ... such that (a) D_{i-1} ⊢ −# O∼a_k or D_{i-1} ⊢ +# O a_k, or (b) ...'. Since Definition 5.3 stipulates that '#-weakly permitted iff D⊢−#O∼l', Definition 5.4 simply conjoins the Def-success termination condition with a restatement of Definition 5.3. The dialogue-game characterization of judicial permission is therefore true by construction, not a consequence of the game's information dynamics; the paper announces it as a definition ('clearly follows from Definition 5.3') rather than deriving it.

full rationale

Definition 5.4 is not derived from the dialogue game; it is a definitional restatement of the Def-succeeds termination condition in Definition 4.1 together with Definition 5.3. The paper's own framing that Definition 5.4 'clearly follows from Definition 5.3' confirms this: the dialogue-game account of judicial permission is stipulated, not proved. The cited inclusion theorem (Proposition 3.1 from [4,8]) and the DDL permission results (Propositions 5.1-5.2 from [10]) are prior published results by the same authors but are independent mathematical claims; they are not circularity, though any misstatement of the inclusion direction would be a correctness issue. A separate formal gap exists: Definition 4.1 omits the fact base F, so D0 cannot derive any non-factual literal and the game may not start; this is a correctness/vacuity problem, not a circularity problem. Because the paper's central characterization of judicial permission in dialogue games reduces by construction to its own termination rule, the circularity score is 6 rather than 0-2.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

No numerical constants are fitted; the only free modeling knob is the proof-standard tag for deontic claims. The paper adds no new explanatory entity, but it imports legal assumptions (legality closure, conflict-free private theories, acyclic norms) that the formal results depend on.

free parameters (1)
  • proof-standard tag # for deontic claims
    Definition 4.1 allows any # among δ, ∂, σ, σ− for the deontic claims ClaimO; the resulting judicial-permission conclusion depends on the selected tag, and the paper does not derive it from legal rules.
assumptions (4)
  • domain assumption Any action not prohibited is permitted by criminal law (nullum crimen sine lege)
    Invoked in Section 3 to turn failure to prove O~l into weak permission, with the caveat that afflictive permissions are excluded.
  • domain assumption Private theories of Pr and Def are conflict-free
    Assumed in Section 4 before Definition 4.1; if a party holds conflicting private rules, the game's termination semantics is undefined.
  • domain assumption The superiority relation > is acyclic and F contains no conflicting deontic pairs
    Required by Propositions 5.1 and 5.2; legal norm hierarchies can contain cycles in practice.
  • domain assumption Judicial approval of moves is omitted
    Explicitly stated in Section 4 as a simplification; without this, Definition 4.1 would need a Choice function as the footnote suggests.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Judicial Permission." pith.science (2026). https://pith.science/paper/DRBK62CH

@misc{pith2026250604610,
  author       = {Pith},
  title        = {Pith review of: Judicial Permission},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DRBK62CH}},
  note         = {Machine review of arXiv:2506.04610}
}
read the original abstract

This paper examines the significance of weak permissions in criminal trials (\emph{judicial permission}). It introduces a dialogue game model to systematically address judicial permissions, considering different standards of proof and argumentation semantics.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages

  1. [1]

    C. E. Alchourrón and E. Bulygin. 1971.Normative Systems. Springer Vienna

    work page 1971

  2. [2]

    C. E. Alchourrón and E. Bulygin. 1984. Permission and permissive norms. In Theorie der Normen. W. K. et al., (Ed.) Duncker & Humblot

    work page 1984

  3. [3]

    Ashworth and J

    A. Ashworth and J. Horder. 2013.Principles of Criminal Law. Oxford University Press, Oxford

    work page 2013

  4. [4]

    Billington, G

    D. Billington, G. Antoniou, G. Governatori, and M. J. Maher. 2010. An inclusion theorem for defeasible logic.ACM Transactions in Computational Logic, 12, 1, article 6

    work page 2010

  5. [5]

    Brewka and T

    G. Brewka and T. F. Gordon. 2010. Carneades and abstract dialectical frame- works: a reconstruction. InProceedings of COMMA 2010. IOS Press, 3–12

    work page 2010

  6. [6]

    T. F. Gordon, H. Prakken, and D. Walton. 2007. The Carneades model of argu- ment and burden of proof.Artificial Intelligence, 171, 10-11, 875–896

    work page 2007

  7. [7]

    T. F. Gordon and D. Walton. 2009. Proof burdens and standards. InArgumenta- tion in Artificial Intelligence. I. Rahwan and G. Simari, (Eds.) Springer, Berlin, 239–260

    work page 2009

  8. [8]

    Governatori

    G. Governatori. 2011. On the relationship between Carneades and defeasible logic. InProceedings ICAIL 2011. K. D. Ashley and T. M. van Engers, (Eds.) ACM, 31–40

    work page 2011

Show all 18 references
  1. [9]

    Governatori, M

    G. Governatori, M. J. Maher, F. Olivieri, A. Rotolo, and S. Scannapieco. 2014. Strategic argumentation under grounded semantics is np-complete. InPro- ceedings EUMAS 2014(Lecture Notes in Computer Science). N. Bulling, (Ed.) Vol. 8953. Springer, 379–387

    2014

  2. [10]

    Governatori, F

    G. Governatori, F. Olivieri, A. Rotolo, and S. Scannapieco. 2013. Computing strong and weak permissions in defeasible logic.Journal of Philosophical Logic, 42, 6, 799–829

    2013

  3. [11]

    Governatori, F

    G. Governatori, F. Olivieri, A. Rotolo, S. Scannapieco, and G. Sartor. 2014. Two faces of strategic argumentation in the law. InProceedings JURIX 2014. R. Hoekstra, (Ed.) IOS Press, 81–90

    2014

  4. [12]

    Governatori, F

    G. Governatori, F. Olivieri, S. Scannapieco, A. Rotolo, and M. Cristani. 2014. Strategic argumentation is np-complete. InProceedings ECAI 2014. T. Schaub, G. Friedrich, and B. O’Sullivan, (Eds.) IOS Press, 399–404

    2014

  5. [13]

    Governatori and A

    G. Governatori and A. Rotolo. 2023. Deontic ambiguities in legal reasoning. In Proceedings ICAIL 2023. M. Grabmair, F. Andrade, and P. Novais, (Eds.) ACM, 91–100

    2023

  6. [14]

    Governatori and A

    G. Governatori and A. Rotolo. 2019. Legislative dialogues with incomplete information. InProceedings JURIX 2019. M. Araszkiewicz and V. Rodríguez- Doncel, (Eds.) IOS Press, 93–102

    2019

  7. [15]

    Governatori, A

    G. Governatori, A. Rotolo, R. Riveret, and S. Villata. 2019. Modelling dialogues for optimal legislation. InProceedings ICAIL 2019. ACM, 229–233

    2019

  8. [16]

    Governatori, A

    G. Governatori, A. Rotolo, and G. Sartor. 2021. Logic and the law: philosophical foundations, deontics, and defeasible reasoning. InHandbook of Deontic Logic and Normative Reasoning. Vol. 2. D. M. Gabbay, J. Horty, X. Parent, R. van der Meyden, and L. van der Torre, (Eds.) Col...

    2021

  9. [17]

    S. O. Hansson. 2021. The varieties of permission. InHandbook of Deontic Logic and Normative Reasoning. Vol. 2. D. M. Gabbay, J. Horty, X. Parent, R. van der Meyden, and L. van der Torre, (Eds.) College Publications, London, 195–240

    2021

  10. [18]

    Makinson and L

    D. Makinson and L. W. N. van der Torre. 2003. Permission from an input/output perspective.Journal of Philosophical Logic, 32, 4, 391–416

    2003

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.