On revision operators

Journal of Symbolic Logic 68 (2):689-711 (2003)
Abstract 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 fully varied revision sequences yields a complete $\Pi_3^1$ set of integers: (iii) the set of stably categorical sentences using their revision operator ψ is similarly $\Pi_3^1$ and which is complete in $G\ddot{o}del's$ universe of constructible sets L: (iv) give an alternative account of a theory of truth-realistic variance that simplifies full variance, whilst at the same time arriving at Kripkean fixed points
Keywords No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,709
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    2 ( #232,684 of 549,671 )

    Recent downloads (6 months)

    1 ( #63,425 of 549,671 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums