Arithmetic Complexity of the Predicate Logics of Complete Arithmetic Theories
- 155 Downloads
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.
KeywordsAtomic Formula Predicate Logic Closed Formula Arithmetic Complexity Arithmetic Theory
Unable to display preview. Download preview PDF.
- Kleene, S. C. (1952). Introduction to Metamathematics. Van Nostrand, New York.Google Scholar
- Plisko, V. E. (1978). Nekotorye varianty poniatia realizuemosti dlia predikatnyh formul. Izvestia Akademii Nauk SSSR. Seria matematicheskaia, 42:636–653. (Some variants of the notion of realizability for predicate formulas. Izvestia Akademii Nauk SSSR. Seria matematicheskaia.42:636–653.) Google Scholar
- Plisko, V. E. (1990). Konstruktivnaia formalizatsia teoremy Tennenbauma i ee primemenenia. Matematicheskie Zametki, 48: 108–118. (Constructive formalization of Tennenbaum’s theorem and its applications. Mat. Zametki, 48:108–118.)Google Scholar
- Plisko, V. E. (1992). Ob arifmeticheskoi slozhnosti nekotoryh konstruktivnyh logik. Matematicheskie Zametki, 52: 94–104. (On arithmetic complexity of certain constructive logics. Matematicheskie Zametki, 52:94–104.)Google Scholar
- Rogers, H. (1967). Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, Mass.Google Scholar
- Tennenbaum, S. (1959). Non-Archimedean systems of arithmetic. Notices of the American Mathematical Society, 6: 270–283.Google Scholar