✦ LIBER ✦

THE MODAL LOGIC OF CONSISTENCY ASSERTIONS OF PEANO ARITHMETIC

✍ Scribed by Silvio Valentini

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 408 KB
Volume: 29
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19830290105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Recursively Saturated Part of Models

The Recursively Saturated Part of Models of Peano Arithmetic

✍ Henryk Kotlarski 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 1 views

PA we define the rfcursively saturated part of XU by RS(9Jl) = ( a E $1: ( 3 8 < YJ?) ( a E )%I and 8 is recursively saturated)). We shall study various possibilities for the relationship between 912 and RS(XU). Tliii paper has grown out of our observation that it may happen that , D is a simple ex

The shortest definition of a number in P

The shortest definition of a number in Peano arithmetic

✍ Dev K. Roy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 2 views

## Abstract The shortest definition of a number by a first order formula with one free variable, where the notion of a formula defining a number extends a notion used by Boolos in a proof of the Incompleteness Theorem, is shown to be non computable. This is followed by an examination of the complex

Expanding the additive reduct of a model

Expanding the additive reduct of a model of Peano arithmetic

✍ Masahiko Murakami; Akito Tsuboi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 2 views

## Abstract Let __M__ be a model of first order Peano arithmetic (**PA**) and __I__ an initial segment of __M__ that is closed under multiplication. Let__M__~0~ be the {0, 1,+}‐reduct of__M__. We show that there is another model __N__ of **PA** that is also an expansion of __M__~0~ such that __a__

The completeness of monotonic modal logi

The completeness of monotonic modal logics

✍ Brian F. Chellas; Audrey McKinney 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB

The purpose of this paper is to point out an error in KRISTER SEGERBERG'S proof of the completeness of the modal logic R, and to provide a correct proof.2) The correct proofbased on a notion and a strategy suggested by SEOERBERO'S techniquesintroduces a general approach for obtaining completeness th

Update Procedures and the 1-Consistency

Update Procedures and the 1-Consistency of Arithmetic

✍ Jeremy Avigad 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

Do the integers exist? The unknowability

Do the integers exist? The unknowability of arithmetic consistency

✍ Jack T. Schwartz 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB