论文信息 - On a Theorem of Cobham Concerning Undecidable Theories - 字舞流文

On a Theorem of Cobham Concerning Undecidable Theories

[1] Andrzej Ehrenfeucht,et al. Two theories with axioms built by means of pleonasms , 1957, Journal of Symbolic Logic.

[2] Solomon Feferman,et al. Degrees of unsolvability associated with classes of formalized theories , 1957, Journal of Symbolic Logic.

[3] Hilary Putnam,et al. Decidability and essential undecidability , 1957, Journal of Symbolic Logic.

[4] Joseph R. Shoenfield,et al. Degrees of formal systems , 1958, Journal of Symbolic Logic.

[5] Andrzej Mostowski,et al. The Classical and the omega-Complete Arithmetic , 1958, J. Symb. Log..

[6] Saul Kripke,et al. A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[7] S. Feferman,et al. The first order properties of products of algebraic systems , 1959 .

[8] Robert L. Vaught,et al. Sentences true in all constructive models , 1960, Journal of Symbolic Logic.

[9] Hilary Putnam,et al. Exact separation of recursively enumerable sets within theories , 1960 .

[10] Solomon Feferman,et al. Representability op recursively enumerable sets in formal theories , 1960 .

[11] Raymond M. Smullyan,et al. Theories with Effectively Inseparable Nuclei , 1960 .