Repository | Book | Chapter
(2003) Philosophical dimensions of logic and science, Dordrecht, Springer.
Arithmetic complexity of the predicate logics of complete arithmetic theories
Valeri Plisko
pp. 57-66
It seems that the most natural problem in mathematical logic is studying the logics of mathematical theories. If the logics of first-order theories are considered, the situation can be formalized in the following way. Let T be a first-order theory, i.e. a set of closed formulas in a first-order language L. A closed predicate formula is called T-valid if each its closed L-instance is in T. We denote the set of T-valid predicate formulas by L(T) and call it the predicate logic of the theory T.
Publication details
DOI: 10.1007/978-94-017-2612-2_5
Full citation:
Plisko, V. (2003)., Arithmetic complexity of the predicate logics of complete arithmetic theories, in A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical dimensions of logic and science, Dordrecht, Springer, pp. 57-66.
This document is unfortunately not available for download at the moment.