AFTD Auto-Formalizing Theoretical Domains

TwoCounterMachine

structure

A structure TwoCounterMachine parameterized by a type of control states Q : Type*, consisting of a single field transitions which is a finite set of triples (q, instr, q') with q, q' ∈ Q and instr ∈ TwoCounterInstr.

Statement

structure TwoCounterMachine (Q : Type*) where
Defined in
arXiv:2610.23495, Section 2
Verified
19 Oct 2026
Axioms
none listed
Built on 1
  • TwoCounterInstrAn instruction of a 2-counter machine is either an update by a vector of integers (w₁, w₂), or a zero-test on the first counter or the…
Used by 13

Read back from the Lean

A structure TwoCounterMachine parameterized by a type of states Q : Type*, containing a single field transitions which is a finite set (Finset) of triples (q, instr, q') where q, q' : Q and instr is a TwoCounterInstr.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A structure parameterized by a type of control states Q, consisting of a finite set of transitions labelled by 2-counter instructions. -/
structure TwoCounterMachine (Q : Type*) where transitions : Finset (Q × TwoCounterInstr × Q)
See it in the graphDiscuss this resultChallenge it