论文信息 - Relatively precomplete numerations and arithmetic - 字舞流文

Relatively precomplete numerations and arithmetic

Franco Montagna | F. Montagna

[1] Saul A. Kripke. “Flexible” predicates of formal number theory , 1962 .

[2] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[3] George Boolos,et al. Extremely undecidable sentences , 1982, Journal of Symbolic Logic.

[4] Saul A. Kripke,et al. Deduction-preserving "Recursive Isomorphisms" between theories , 1967 .

[5] J. Ersov. Theorie der Numerierungen II , 1973 .

[6] Claudio Bernardi. On the relation provable equivalence and on partitions in effectively inseparable sets , 1981 .

[7] R. Solovay. Provability interpretations of modal logic , 1976 .

[8] Andrea Sorbi,et al. Classifying Positive Equivalence Relations , 1983, J. Symb. Log..