排序方式: 共有24条查询结果,搜索用时 0 毫秒
21.
To the standard propositional modal system of provability logic constants are added to account for the arithmetical fixed points introduced by Bernardi-Montagna in [5]. With that interpretation in mind, a system LR of modal propositional logic is axiomatized, a modal completeness theorem is established for LR and, after that, a uniform arithmetical (Solovay-type) completeness theorem with respect to PA is obtained for LR.
This paper supersedes: Franco Montagna, Extremely undecidable sentences and generic generalized Rosser's fixed points, Rapporto Matematico, No. 95, Siena, 1983. 相似文献
22.
Solovay's 1976 completeness result for modal provability logic employs the recursion theorem in its proof. It is shown that the uses of the recursion theorem can in this proof be replaced by the diagonalization lemma for arithmetic and that, in effect, the proof neatly fits the framework of another, enriched, system of modal logic (the so-called Rosser logic of Gauspari-Solovay, 1979) so that any arithmetical system for which this logic is sound is strong enough to carry out the proof, in particular I0+EXP. The method is adapted to obtain a similar completeness result for the Rosser logic. 相似文献
23.
A Proof of Standard Completeness for Esteva and Godo's Logic MTL 总被引:7,自引:0,他引:7
In the present paper we show that any at most countable linearly-ordered commutative residuated lattice can be embedded into a commutative residuated lattice on the real unit interval [0, 1]. We use this result to show that Esteva and Godo's logic MTL is complete with respect to interpretations into commutative residuated lattices on [0, 1]. This solves an open problem raised in. 相似文献
24.