### 7 papers:

- RTA-2013-WinklerZM #automation #proving #sequence #termination
- Beyond Peano Arithmetic — Automatically Proving Termination of the Goodstein Sequence (SW, HZ, AM), pp. 335–351.
- TLCA-2013-Blot #game studies
- Realizability for Peano Arithmetic with Winning Conditions in HON Games (VB), pp. 77–92.
- CSL-2012-Aschieri #axiom #interactive
- Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms (FA), pp. 31–45.
- CSL-2011-TatsutaB #commutative
- Non-Commutative Infinitary Peano Arithmetic (MT, SB), pp. 538–552.
- ICPR-v4-2002-JhanwarCSZ #image #retrieval #using
- Content Based Image Retrieval Using Optimum Peano Scan (NJ, SC, GS, BZ), pp. 130–133.
- SAC-2002-DingDP #classification #data type #using
- Decision tree classification of spatial data streams using Peano Count Trees (QD, QD, WP), pp. 413–417.
- STOC-1979-ODonnell #independence #programming language #theorem
- A Programming Language Theorem Which Is Independent of Peano Arithmetic (MO), pp. 176–188.