论文信息 - An autostable 1-decidable model without a computable Scott family of ∃-formulas

An autostable 1-decidable model without a computable Scott family of ∃-formulas

We disprove the assumption that the existence of a computable Scott family of ∃-formulas with a finite tuple of parameters from a 1-decidable model is a necessary condition of its being autostable. Given a family S of general recursive functions, we construct a unar ms and find the family S for which ms is the desired counterexample.

O. V. Kudinov | O. Kudinov

[1] Peter Hilton,et al. Introduction to the Theory of Categories and Functors , 1968 .

[2] Leo F. Boron,et al. Algorithms and recursive functions , 1970 .

[3] S. S. Goncharov,et al. Autostability and computable families of constructivizations , 1975 .

[4] V. Selivanov. Enumerations of families of general recursive functions , 1976 .

[5] O. V. Kudinov. Criteria of autostability for 1-decidable models , 1992 .