Parameter‐Free Universal Induction
1989; Wiley; Volume: 35; Issue: 5 Linguagem: Inglês
10.1002/malq.19890350511
ISSN1521-3870
Autores Tópico(s)Logic, Reasoning, and Knowledge
ResumoMathematical Logic QuarterlyVolume 35, Issue 5 p. 443-456 Article Parameter-Free Universal Induction Richard Kaye, Richard Kaye Jesus College Oxford, OX1 3DW Great BritainSearch for more papers by this author Richard Kaye, Richard Kaye Jesus College Oxford, OX1 3DW Great BritainSearch for more papers by this author First published: 1989 https://doi.org/10.1002/malq.19890350511Citations: 8AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onEmailFacebookTwitterLinkedInRedditWechat References 1 Buss, S., Bounded arithmetic. Ph. D. Dissertation, Princeton 1985. 2 Gaifman, H., A note on models and submodels of arithmetic. In: Proc. of the Conference on Mathematical Logic, London 1970, Springer Lecture Notes in Mathematics 255 (1971), pp. 128 to 144. 3 Gaifman, H., and C. Dimitracopoulos, Fragments of arithmetic and the MRDP theorem. In: Logic and Algorithmic, Monographic No. 30 de L'Enseignement Mathématique (1982), pp. 187 to 206. 4 Kaye, R., Diophantine induction and parameter-free induction. Ph. D. Dissertation, Manchester 1987. Part I (Diophantine induction) submitted to the Annals of Pure and Applied Logic. 5 Kaye, R., Axiomatizations and quantifier complexity. To appear in the Proceedings of the 6th Easter Conference on Model Theory, Berlin 1988. 6 Kaye, R., Paris, J., and C. Dimitracopoulos, Parameter-free induction schemas. To appear in J. Symbolic Logic. 7 Paris, J., O structuře modelů omenzené E1 indukce. Casopis Pêstování Matematiky 109 (1984), 372–379. 8 Paris, J., and L. Kirby, Σn collection schemas in arithmetic. In: Logic Colloquium '77, North-Holland Publ. Comp. Amsterdam 1978, pp. 199–209. 9 Parsons, C., On a number theoretic choice schema and its relation to arithmetic. In: Intuitionism and Proof Theory, North-Holland Publ. Comp., Amsterdam 1970, pp. 459–473. 10 Robinson, J., Existential definability in arithmetic. Trans. Amer. Math. Soc. 72 (1952), 437 to 449. 11 Shepherdson, J., A nonstandard model for a free-variable fragment of number theory. Bull. de l'Académie Polonaise des Sciences, Série des Sciences, Math., Astr. et Phys. 12 (1964), 79–86. 12 van den Dries, L., Some model theory and number theory for models of weak systems of arithmetic. In: Model Theory of Algebra and Arithmetic, Springer Lecture Notes in Mathematics 834 (1981), pp. 346–362. 13 Wilkie, A., Some results and problems on weak systems of arithmetic. In: Logic Colloquium '77, North-Holland Publ. Comp., Amsterdam 1978, pp. 285–296. 14 Wilkie, A., Applications of complexity theory to Σ0-definability problems in arithmetic. In: Model Theory of Algebra and Arithmetic, Springer Lecture Notes in Mathematics 834 (1981), pp. 363–369. 15 Wilmers, G., Bounded existential induction. J. Symbolic Logic 50 (1985), 72–90. Citing Literature Volume35, Issue51989Pages 443-456 ReferencesRelatedInformation
Referência(s)