Finitary consistency of a free arithmetic
type: Item
instance of: scholarly article
title: Finitary consistency of a free arithmetic
zbMATH Open document ID: 0545.03034
author: Ermanno Bencivenga
published in: Notre Dame Journal of Formal Logic
publication date: 1984-01-01T00:00:00Z
review text: A free variant FA of Peano arithmetic is proved consistent by using finite (outer domain) models. FA is weaker than standard arithmetic in two senses. First, one cannot prove that the successor, addition, and multiplication functions are always defined. Second, one cannot prove \(\sim s(t)=0.\) However, one can prove both of the above for closed terms.
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 3867320
zbMATH Keywords: finitary consistency
zbMATH Keywords: free arithmetic
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1093870628
OpenAlex ID: W2023616008
DOI: 10.1305/NDJFL/1093870628
description: scientific article; zbMATH DE number 3867320