Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T14:18:51.908Z Has data issue: false hasContentIssue false

Vaught's Theorem on Axiomatizability by a Scheme

Published online by Cambridge University Press:  15 January 2014

Albert Visser*
Affiliation:
Department of Philosophy, Utrecht University, Janskerkhof 13A 3512BL Utrecht, The Netherlands, E-mail: Albert.Visser@phil.uu.nl

Abstract

In his 1967 paper Vaught used an ingenious argument to show that every recursively enumerable first order theory that directly interprets the weak system VS of set theory is axiomatizable by a scheme. In this paper we establish a strengthening of Vaught's theorem by weakening the hypothesis of direct interpretability of VS to direct interpretability of the finitely axiomatized fragment VS2 of VS. This improvement significantly increases the scope of the original result, since VS is essentially undecidable, but VS2 has decidable extensions. We also explore the ramifications of our work on finite axiomatizability of schemes in the presence of suitable comprehension principles.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable