AFTD Auto-Formalizing Theoretical Domains

two_counter_machine_boundary

def

A configuration of a 2-counter machine lies on the boundary if at least one of its two counters is zero.

Statement

def two_counter_machine_boundary {Q : Type*} (c : Q × ℕ × ℕ) : Prop
Source
step towards symmetric_two_counter_boundary_reachability_semilinear
Verified
20 Oct 2026
Axioms
none listed

Lean source view module on GitHub

/-- The boundary predicate: at least one counter is zero. Zero tests are enabled exactly at boundary configurations. -/
def two_counter_machine_boundary {Q : Type*} (c : Q × ℕ × ℕ) : Prop := c.2.1 = 0 ∨ c.2.2 = 0
See it in the graphDiscuss this resultChallenge it