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

Categories

Keywords

Reprint years

DOI

10.1007/s001530050042

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

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

Through your library

My notes

Similar books and articles

Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.
Algebraic semantics for deductive systems.W. J. Blok & J. Rebagliato - 2003 - Studia Logica 74 (1-2):153 - 180.
Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
For everyn, then-freely generated algebra is not functionally free in the equational class of diagonalizable algebras.Franco Montagna - 1975 - Studia Logica 34 (4):315 - 319.
Algebraic Kripke-Style Semantics for Relevance Logics.Eunsuk Yang - 2014 - Journal of Philosophical Logic 43 (4):803-826.
Algebraic Methods and Bounded Formulas.Domenico Zambella - 1997 - Notre Dame Journal of Formal Logic 38 (1):37-48.
Quantified propositional calculus and a second-order theory for NC1.Stephen Cook & Tsuyoshi Morioka - 2005 - Archive for Mathematical Logic 44 (6):711-749.
Systems for a foundation of arithmetic.Andrew Boucher - manuscript
On Finite Approximations of Topological Algebraic Systems.L. Yu Glebsky, E. I. Gordon & C. Ward Hensen - 2007 - Journal of Symbolic Logic 72 (1):1 - 25.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Monadic Bounded Algebras.Galym Akishev & Robert Goldblatt - 2010 - Studia Logica 96 (1):1 - 40.
Categorical Abstract Algebraic Logic: Algebraic Semantics for (documentclass{article}usepackage{amssymb}begin{document}pagestyle{empty}$bf{pi }$end{document})‐Institutions.George Voutsadakis - 2013 - Mathematical Logic Quarterly 59 (3):177-200.
"True" arithmetic can prove its own consistency.Andrew Boucher -

Analytics

Added to PP
2013-11-23

Downloads
21 (#733,267)

6 months
1 (#1,461,875)

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