|
This article is cited in 15 scientific papers (total in 15 papers)
On first order logic of proofs
S. N. Artemova, T. Yavorskayab a City University of New York, Graduate Center
b M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The Logic of Proofs LP solved long standing Gödel's problem concerning his provability calculus (cf. [1]). It also opened new lines of research in proof theory, modal logic, typed programming languages, knowledge representation, etc. The propositional logic of proofs is decidable and admits a complete axiomatization. In this paper we show that the first order logic of proofs is not recursively axiomatizable.
Key words and phrases:
Logic of proofs, provability, recursive axiomatizability.
Received: July 7, 2001; in revised form January 9, 2002
Citation:
S. N. Artemov, T. Yavorskaya, “On first order logic of proofs”, Mosc. Math. J., 1:4 (2001), 475–490
Linking options:
https://www.mathnet.ru/eng/mmj32 https://www.mathnet.ru/eng/mmj/v1/i4/p475
|
Statistics & downloads: |
Abstract page: | 379 | References: | 71 |
|