Categories of theories and interpretations

@article{Visser2004CategoriesOT,
  title={Categories of theories and interpretations},
  author={A. Visser},
  journal={Logic group preprint series},
  year={2004},
  volume={228}
}
  • A. Visser
  • Published 2004
  • 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… Expand
EQUIVALENCES FOR TRUTH PREDICATES
  • Carlo Nicolai
  • Computer Science, Mathematics
  • The Review of Symbolic Logic
  • 2017
TLDR
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. Expand
When Bi-Interpretability Implies Synonymy
Two salient notions of sameness of theories are synonymy, aka definitional equivalence, and bi-interpretability. Of these two definitional equivalence is the strictest notion. In which cases can weExpand
Gaps, Gluts, and Theoretical Equivalence
When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving twowell-known variants Kripke-Feferman truth. The first, KF+CONS,Expand
The Second Incompleteness Theorem and Bounded Interpretations
  • A. Visser
  • Mathematics, Computer Science
  • Stud Logica
  • 2012
TLDR
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. Expand
DISTANCES BETWEEN FORMAL THEORIES
TLDR
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. Expand
MINIMAL TRUTH AND INTERPRETABILITY
  • Martin Fischer
  • Computer Science, Mathematics
  • The Review of Symbolic Logic
  • 2009
TLDR
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. Expand
THE EXPRESSIVE POWER OF TRUTH
TLDR
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. Expand
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 ofExpand
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,Expand
LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC
  • S. Walsh
  • Computer Science
  • The Review of Symbolic Logic
  • 2014
TLDR
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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
Cuts, Consistency Statements and Interpretations
  • P. Pudlák
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1985
TLDR
The importance of cuts for interpretations in GB was realized already by Vopěnka and Hajek in [30], and Pioneering work was done by Solovay in [24], where he developed the method of “ shortening of cuts ”. Expand
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 aExpand
An Overview of Interpretability Logic
  • A. Visser
  • Computer Science, Mathematics
  • Advances in Modal Logic
  • 1996
TLDR
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. Expand
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. RigidExpand
Faith & Falsity. A study of faithful interpretations and false Σ01-sentences
A theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfully interpretable. In this paper we provide a characterization of trustworthiness. We provide a simpleExpand
Bounded Arithmetic と計算量の根本問題
59.4 T h e C u t Elimination Theorem for Second Order Logic 171 (respectively, v . ) . In particular, (a) guarantees t h a t *"-PIND or c ~ ' ~ I N D , and C ~ ' ~ C R inferences are still validExpand
On the length of proofs of finitistic consistency statements in first order theories
Publisher Summary This chapter focuses on the length of proofs of finitistic consistency statements in first order theories. By the second incompleteness theorem of Godel, a sufficiently rich theoryExpand
Metamathematics of First-Order Arithmetic
TLDR
This chapter discusses Arithmetic as Number Theory, Set Theory and Logic, Fragments and Combinatorics, and Models of Fragments of Arithmetic. Expand
Conservative Theories of Classical Truth
  • V. Halbach
  • Mathematics, Computer Science
  • Stud Logica
  • 1999
TLDR
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. Expand
Categorical Logic and Type Theory
  • B. Jacobs
  • Computer Science, Mathematics
  • Studies in logic and the foundations of mathematics
  • 2001
TLDR
This chapter discusses fibred category theory, which is concerned with the role of type theory in the development of categorical identity and its role in the construction of types. Expand
...
1
2
3
4
5
...