Abstract
A reflection principle is a sequent of the form \( \left[ {\left( {\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}\to {z} } \right)DT\left( {U,\left[ { \to C} \right]} \right) \to C} \right]\left[ {\frac{X}{{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}\to {x} }}} \right]\), where X are irreducible terms. (Anything enclosed within ‘[…]’ brackets is a sequent.)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Fletcher, P. (1998). The Coding of Trees. In: Truth, Proof and Infinity. Synthese Library, vol 276. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3616-9_22
Download citation
DOI: https://doi.org/10.1007/978-94-017-3616-9_22
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5105-9
Online ISBN: 978-94-017-3616-9
eBook Packages: Springer Book Archive