Interpretability Logic

Albert Visser
Additional contact information
Albert Visser: University of Utrecht, Department of Philosophy

A chapter in Mathematical Logic, 1990, pp 175-209 from Springer

Abstract: Abstract Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbert-style programs Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength of theories, or better to prove conservation results within a properly weak theory. An advantage of using interpretations is that even if their use should — perhaps- be classified as a proof-theoretical method, it is often possible to employ a model-theoretical heuristics. An example is given in section 7.2 where a conservation result due to Paris & Wilkie, which is proven by a model-theoretical argument, is formalized in a weak theory. For more discussion of and perspective on the use of interpretability in reductive programs the reader is referred to Feferman[1988].

Keywords: Natural Number; Relation Symbol; Sequential Theory; Provability Logic; Logic Colloquium (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0609-2_13

Ordering information: This item can be ordered from
http://www.springer.com/9781461306092

DOI: 10.1007/978-1-4613-0609-2_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().