Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T09:01:54.813Z Has data issue: false hasContentIssue false

Implicit definability and infinitary languages1

Published online by Cambridge University Press:  12 March 2014

Kenneth Kunen*
Affiliation:
Stanford University

Extract

In this paper we define the notions of invariant implicit definability (i.i.d.) and semi-invariant implicit definability (s.i.i.d.) on ε-models, A, of a certain weak set theory. These notions are intended to be the analogs of recursiveness and recursive enumerability, respectively. Following Barwise, with each A is associated an infinitary language whose formulas are elements of A.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1968

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