Equational fragments of systems for arithmetic.
In the paper, varieties generated by classes of models of some algebraic fragments are investigated. The aim of the paper is to describe arithmetic by means of finitely many operations having a clear algebraic meaning and coming from traditional algebra, such as sum, difference, product, \(0\), \(1\) and the lattice operations (which come from the theory of \(l\)-rings). The authors investigate equational fragments of formal systems for arithmetic by means of the equational theory of \(f\)-rings and of their positive cones. They start from the observation that a model of arithmetic is the positive cone of a discretely ordered ring. A consequence of the discreteness of the order is the presence of a discriminator, which allows one to derive many properties of the models of the considered equational theories.
- scientific article; zbMATH DE number 4068843
- An algebraic treatment of quantifier-free systems of arithmetic
- Automated Deduction – CADE-19
- Diophantine equations in fragments in arithmetic
- A bounded arithmetic AID for Frege systems
- scientific article; zbMATH DE number 19304
- scientific article; zbMATH DE number 903037
- scientific article; zbMATH DE number 3353345
- scientific article; zbMATH DE number 700342
- Simple equational specifications of rational arithmetic
This page was built for publication: Equational fragments of systems for arithmetic.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771883)