Premium
AN ELEMENTARY SYSTEM AS AND ITS SEMI‐COMPLETENESS AND DECIDABILITY
Author(s) -
Jun Qin
Publication year - 1992
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19920380128
Subject(s) - decidability , completeness (order theory) , mathematics , gödel's completeness theorem , calculus (dental) , constant (computer programming) , discrete mathematics , algebra over a field , pure mathematics , programming language , computer science , mathematical analysis , medicine , dentistry
The author establishes an elementary system AS which contains functions +, ≐ and a constant 0 and then proves the semi‐completeness and the decidability of AS, using the theory of systems of inequalities.