Categories of theories and interpretations

  title={Categories of theories and interpretations},
  author={Albert Visser},
  journal={Logic group preprint series},
  • A. Visser
  • Published 1 April 2004
  • Philosophy, Mathematics
  • Logic group preprint series
In this paper we study categories of theories and interpretations. In these categories, notions of sameness of theories, like synonymy, bi-interpretability and mutual interpretability, take the form of isomorphism. We study the usual notions like monomorphism and product in the various theories. We provide some examples to separate notions across categories. In contrast, we show that, in some cases, notions in different categories do coincide. E.g., we can, under such-and-such conditions… 


This work studies possible ways to make precise the relation of conceptual equivalence between notions of truth associated with collections of principles of truth and employs suitable variants of notions of equivalence of theories considered in Visser (2006) and Friedman & VISSer (2014) to show that there is a precise sense in which ramified truth does not correspond to iterations of comprehension.

When Bi-Interpretability Implies Synonymy

A version of the Schroder-Bernstein theorem under very weak conditions is provided to show that there are two finitely axiomatized sequential theories that are bi- interpretable but not synonymous, where precisely one of the interpretations involved in the bi-interpretation is not identity preserving.

The Second Incompleteness Theorem and Bounded Interpretations

  • A. Visser
  • Mathematics, Philosophy
    Stud Logica
  • 2012
A version of Second Incompleteness Theorem is formulated, which states that a sequential sentence has ‘consistency power’ over a theory if it enables us to construct a bounded interpretation of that theory.


This article provides a means to measure distances (and explore connections) between formal theories, and introduces two natural notions for such distances: that of conceptual distance and that of axiomatic distance.


This paper will investigate different axiomatic theories of truth that are minimal in some sense, one criterion for minimality will be conservativity over Peano Arithmetic, and show that disquotational theories ofTruth, as well as compositional theories oftruth with restricted induction are relatively interpretable in PeanoArithmetic.


In this article it is argued that there are indeed natural truth theories which satisfy both the demand of semantical conservativeness and thedemand of adequately extending the expressive power of the authors' language.

Ideas and Results in Model Theory: Reference, Realism, Structure and Categoricity

The topics of reference, realism, and structure have been discussed extensively in the philosophy of mathematics of the last decades. There have been some parallel discussions in certain parts of

Non-contractive logics, Paradoxes, and Multiplicative Quantifiers

It is proved that the logic of these multiplicative quantifiers (but without disquotational truth) is consistent, by showing that an inflnitary version of the cut rule can be eliminated and paves the way to a syntactic approach to the proof theory of in-nitary logic with in-Nite sequents.

Set-Theory and Higher-Order Logic: Foundational Issues and Mathematical Developments

In 1990, W. Hugh Woodin introduced Omega-logic as an approach to truth in the universe of all sets inspired by recent work on large cardinals and determinacy. In Omega-logic statements are valid if,


  • S. Walsh
  • Philosophy
    The Review of Symbolic Logic
  • 2014
This discussion is significant because it gives a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics.



Cuts, consistency statements and interpretations

  • P. Pudlák
  • Computer Science
    Journal of Symbolic Logic
  • 1985
This paper wants to study statements for nonreflexive theories, especially for finitely axiomatizable theories (which are never reflexive).

Deduction-preserving "Recursive Isomorphisms" between theories

Introduction. In this work we discuss recursive mappings between theories which preserve deducibility, negation and implication. Roughly, we prove that any two axiomatizable theories containing a

An Overview of Interpretability Logic

  • A. Visser
  • Philosophy
    Advances in Modal Logic
  • 1996
This work translates the modal operators of themodal theories to certain specic, fixed, defined predicates of the predicate logical theories of striking simplicity, and interprets the propositional variables by arbitrary predicate logical sentences.

Finitely Axiomatizable Theories

Interpretations. A Classification to Property Lists. Reductions of Signatures. Quasi-Succession of Morley Rank 2. Constructions with Empty Property List. Constructions with Unary Property List. Rigid

Faith & Falsity. A study of faithful interpretations and false Σ01-sentences

A simple proof of Friedman’s Theorem that finitely axiomatized, sequential, consistent theories are trustworthy is provided.

Metamathematics of First-Order Arithmetic

This chapter discusses Arithmetic as Number Theory, Set Theory and Logic, Fragments and Combinatorics, and Models of Fragments of Arithmetic.

Conservative Theories of Classical Truth

It is shown by purely finitistically means that the theory PA ÷ "there is a satisfaction class" and the theory FS↾ of [2] are conservative over PA.

Categorical Logic and Type Theory

  • B. Jacobs
  • Philosophy
    Studies in logic and the foundations of mathematics
  • 2001

The formalization of Interpretability

This paper contains a careful derivation of principles of Interpretability Logic valid in extensions of IΔ0+Ω1.