An algebraic treatment of quantifier-free systems of arithmetic

Archive for Mathematical Logic 35 (4):209-224 (1996)
  Copy   BIBTEX

Abstract

By algebraic means, we give an equational axiomatization of the equational fragments of various systems of arithmetic. We also introduce a faithful semantics according to which, for every reasonable system T for arithmetic, there is a model where exactly the theorems of T are true

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-23

Downloads
21 (#762,792)

6 months
1 (#1,516,603)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

An algebraic approach to propositional fuzzy logic.Franco Montagna - 2000 - Journal of Logic, Language and Information 9 (1):91-124.

Add more citations

References found in this work

Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.

Add more references