Partial decidability of the nonequivalence of free schemata
From MaRDI portal
Publication:1136493
zbMath0427.68018MaRDI QIDQ1136493
Publication date: 1979
Published in: Programming and Computer Software (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)
This page was built for publication: Partial decidability of the nonequivalence of free schemata