Switch to: References

Add citations

You must login to add citations.
  1. The Arithmetics of a Theory.Albert Visser - 2015 - Notre Dame Journal of Formal Logic 56 (1):81-119.
    In this paper we study the interpretations of a weak arithmetic, like Buss’s theory $\mathsf{S}^{1}_{2}$, in a given theory $U$. We call these interpretations the arithmetics of $U$. We develop the basics of the structure of the arithmetics of $U$. We study the provability logic of $U$ from the standpoint of the framework of the arithmetics of $U$. Finally, we provide a deeper study of the arithmetics of a finitely axiomatized sequential theory.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Faith & falsity.Albert Visser - 2004 - Annals of Pure and Applied Logic 131 (1-3):103-131.
    A theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfully interpretable. In this paper we give a characterization of trustworthiness. We provide a simple proof of Friedman’s Theorem that finitely axiomatized, sequential, consistent theories are trustworthy. We provide an example of a theory whose schematic predicate logic is complete Π20.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Interpretability in reflexive theories - a survey.Per Lindström - 1997 - Theoria 63 (3):182-209.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
    In his paper "Undecidability without arithmetization," Andrzej Grzegorczyk introduces a theory of concatenation $\mathsf{TC}$. We show that pairing is not definable in $\mathsf{TC}$. We determine a reasonable extension of $\mathsf{TC}$ that is sequential, that is, has a good sequence coding.
    Download  
     
    Export citation  
     
    Bookmark   17 citations