Abstract
The predicate logic of recursive realizability was carefully studied by the author in the 1970s. In particular, it was proved that the predicate realizability logic changes if the basic language of formal arithmetic is replaced by its extension with the truth predicate. In the paper this result is generalized by considering similar extensions of the arithmetical language by transfinite induction up to an arbitrary constructive ordinal. Namely, for every constructive ordinal α, a transfinite sequence of extensions LA β (β ≤ α) of the first-order language of formal arithmetic is considered. Constructive semantics for these languages is defined in terms of recursive realizability. Variants of LA β -realizability for the predicate formulas are considered and corresponding predicate logics are studied.
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.
References
Kleene, S.C.: On the interpretation of intuitionistic number theory. Journal of Symbolic Logic 10, 109–124 (1945)
Plisko, V.E.: On realizable predicate formulae (Russian). Doklady Akademii Nauk SSSR 212, 553–556 (1973); Translation Soviet Math. Dokl. 14, 1420–1424
Plisko, V.E.: The nonarithmeticity of the class of realizable predicate formulas (Russian). Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya 41, 483–502 (1977); Translation Math. USSR Izvestiya 11, 453–471
Plisko, V.E.: Recursive realizability and constructive predicate logic (Russian). Doklady Akademii Nauk SSSR 214, 520–523 (1974); Translation Soviet Math. Dokl. 15, 193–197
Plisko, V.E.: Absolute realizability of predicate formulas (Russian). Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya 47, 315–334 (1983); Translation Math. USSR Izvestiya 22, 291–308
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York (1967)
Plisko, V.E.: Some variants of the notion of realizability for predicate formulas (Russian). Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya 42, 637–653 (1978); Translation Math. USSR Izvestiya 12, 588–604
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plisko, V. (2010). Transfinite Sequences of Constructive Predicate Logics. In: Ablayev, F., Mayr, E.W. (eds) Computer Science – Theory and Applications. CSR 2010. Lecture Notes in Computer Science, vol 6072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13182-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-13182-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13181-3
Online ISBN: 978-3-642-13182-0
eBook Packages: Computer ScienceComputer Science (R0)