Citations of work:

G. Aldo Antonelli (1994). A Revision-Theoretic Analysis of the Arithmetical Hierarchy.

5 found
Order:
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  6
    Guest Editors’ Introduction.Riccardo Bruni & Shawn Standefer - forthcoming - Journal of Philosophical Logic:1-9.
  2.  15
    Proof Theory for Functional Modal Logic.Shawn Standefer - 2018 - Studia Logica 106 (1):49-84.
    We present some proof-theoretic results for the normal modal logic whose characteristic axiom is \. We present a sequent system for this logic and a hypersequent system for its first-order form and show that these are equivalent to Hilbert-style axiomatizations. We show that the question of validity for these logics reduces to that of classical tautologyhood and first-order logical truth, respectively. We close by proving equivalences with a Fitch-style proof system for revision theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  19
    On Revision Operators.P. D. Welch - 2003 - Journal of Symbolic Logic 68 (2):689-711.
    We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ is similarly \Pi13 and which (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  4.  32
    On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and the Next Stable Set.P. D. Welch - 2001 - Bulletin of Symbolic Logic 7 (3):345-360.
    We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  5.  37
    What's in a Function?Gian Aldo Antonelli - 1996 - Synthese 107 (2):167 - 204.
    In this paper we argue that Revision Rules, introduced by Anil Gupta and Nuel Belnap as a tool for the analysis of the concept of truth, also provide a useful tool for defining computable functions. This also makes good on Gupta's and Belnap's claim that Revision Rules provide a general theory of definition, a claim for which they supply only the example of truth. In particular we show how Revision Rules arise naturally from relaxing and generalizing a classical construction due (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations