Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T00:56:26.374Z Has data issue: false hasContentIssue false

On first-order theories with provability operator

Published online by Cambridge University Press:  12 March 2014

Sergei Artëmov
Affiliation:
Steklov Mathematical Institute, 42, Vavilov Str., Moscow, 117966, Russia, E-mail: art@log.mian.su
Franco Montagna
Affiliation:
Dipartimento di Matematica, Universita di Siena, 53100-Siena, Italia, E-mail: montagna@sivax.cineca.it

Abstract

In this paper the modal operator “x is provable in Peano Arithmetic” is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable