The formalization of interpretability
type: Item
instance of: scholarly article
title: The formalization of interpretability
zbMATH Open document ID: 0744.03023
DOI: 10.1007/BF00370389
author: Albert Visser
published in: Studia Logica
publication date: 1992-06-25T00:00:00Z
review text: The author discusses interpretability in weak theories without \(\Sigma_ 1\)-collection principle for details and gives a careful derivation of principles of Interpretability Logic valid in any extension of I\(\Delta_ 0+\Omega_ 1\). The case containing the \(\Sigma_ 1\)- collection principle is also discussed in relation with cut and with the conservation problem. This paper provides an extensive introduction to the formalization of interpretability, and the comprehensive references are useful.
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03F25
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03F40
zbMATH DE Number: 13442
zbMATH Keywords: fragments of arithmetic
zbMATH Keywords: Henkin construction
zbMATH Keywords: modal logic
zbMATH Keywords: interpretability in weak theories
zbMATH Keywords: Interpretability Logic
zbMATH Keywords: conservation
reviewed by: Osamu Sonobe
MaRDI profile type: MaRDI publication profile
cites work: ON MODAL LOGICS AXIOMATIZING PROVABILITY
cites work: The interpretability logic of Peano arithmetic
cites work: Arithmetization of metamathematics in a general setting
cites work: Partially Conservative Extensions of Arithmetic
cites work: On certain lattices of degrees of interpretability
cites work: On Partially Conservative Sentences and Interpretability
cites work: Q4726219
cites work: Relative Interpretations
cites work: Existence and feasibility in arithmetic
cites work: A note on the undefinability of cuts
cites work: On the scheme of induction for bounded arithmetic formulas
cites work: Some Prime Elements in the Lattice of Interpretability Types
cites work: Q3315507
cites work: Cuts, consistency statements and interpretations
cites work: Q4193434
cites work: Q3942957
cites work: Modal analysis of generalized rosser sentences
cites work: Bounded arithmetic and truth definition
cites work: The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
description: scientific article; zbMATH DE number 13442