An elementary system as and its semi‐completeness and decidability

Mathematical Logic Quarterly 38 (1):305-320 (1992)
  Copy   BIBTEX

Abstract

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

Other Versions

reprint Jun, Qin (1992) "An elementary system as and its semi-completeness and decidability". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38(1):305-320

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
40 (#553,485)

6 months
5 (#1,015,253)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references