Switch to: References

Add citations

You must login to add citations.
  1. Universes over Frege structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.
    In this paper, we study a concept of universe for a truth predicate over applicative theories. A proof-theoretic analysis is given by use of transfinitely iterated fixed point theories . The lower bound is obtained by a syntactical interpretation of these theories. Thus, universes over Frege structures represent a syntactically expressive framework of metapredicative theories in the context of applicative theories.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The [mathematical formula] quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals.Markus Marzetta & Thomas Strahm - 1997 - Archive for Mathematical Logic 36 (6):391-413.
    This paper is about two topics: 1. systems of explicit mathematics with universes and a non-constructive quantification operator $\mu$; 2. iterated fixed point theories with ordinals. We give a proof-theoretic treatment of both families of theories; in particular, ordinal theories are used to get upper bounds for explicit theories with finitely many universes.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.
    In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The unfolding of non-finitist arithmetic.Solomon Feferman & Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):75-96.
    The unfolding of schematic formal systems is a novel concept which was initiated in Feferman , Gödel ’96, Lecture Notes in Logic, Springer, Berlin, 1996, pp. 3–22). This paper is mainly concerned with the proof-theoretic analysis of various unfolding systems for non-finitist arithmetic . In particular, we examine two restricted unfoldings and , as well as a full unfolding, . The principal results then state: is equivalent to ; is equivalent to ; is equivalent to . Thus is proof-theoretically equivalent (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Explicit mathematics: power types and overloading.Thomas Studer - 2005 - Annals of Pure and Applied Logic 134 (2-3):284-302.
    Systems of explicit mathematics provide an axiomatic framework for representing programs and proving properties of them. We introduce such a system with a new form of power types using a monotone power type generator. These power types allow us to model impredicative overloading. This is a very general form of type dependent computation which occurs in the study of object-oriented programming languages. We also present a set-theoretic interpretation for monotone power types. Thus establishing the consistency our system of explicit mathematics.
    Download  
     
    Export citation  
     
    Bookmark  
  • The non-constructive μ operator, fixed point theories with ordinals, and the bar rule.Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):305-324.
    This paper deals with the proof theory of first-order applicative theories with non-constructive μ operator and a form of the bar rule, yielding systems of ordinal strength Γ0 and 20, respectively. Relevant use is made of fixed-point theories with ordinals plus bar rule.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the proof theory of type two functionals based on primitive recursive operations.David Steiner & Thomas Strahm - 2006 - Mathematical Logic Quarterly 52 (3):237-252.
    This paper is a companion to work of Feferman, Jäger, Glaß, and Strahm on the proof theory of the type two functionals μ and E1 in the context of Feferman-style applicative theories. In contrast to the previous work, we analyze these two functionals in the context of Schlüter's weakened applicative basis PRON which allows for an interpretation in the primitive recursive indices. The proof-theoretic strength of PRON augmented by μ and E1 is measured in terms of the two subsystems of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The proof-theoretic analysis of Σ11 transfinite dependent choice.Christian Rüede - 2003 - Annals of Pure and Applied Logic 122 (1-3):195-234.
    This article provides an ordinal analysis of Σ11 transfinite dependent choice.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The proof-theoretic analysis of Σ< sub> 1< sup> 1 transfinite dependent choice.Christian Rüede - 2003 - Annals of Pure and Applied Logic 122 (1):195-234.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Unifying the Philosophy of Truth.Theodora Achourioti, Henri Galinon, José Martínez Fernández & Kentaro Fujimoto (eds.) - 2015 - Dordrecht, Netherland: Springer.
    This anthology of the very latest research on truth features the work of recognized luminaries in the field, put together following a rigorous refereeing process. Along with an introduction outlining the central issues in the field, it provides a unique and unrivaled view of contemporary work on the nature of truth, with papers selected from key conferences in 2011 such as Truth Be Told, Truth at Work, Paradoxes of Truth and Denotation and Axiomatic Theories of Truth. Studying the nature of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation