Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-13T15:57:44.830Z Has data issue: false hasContentIssue false

Almost combinatorial Skolem functions

Published online by Cambridge University Press:  12 March 2014

Erik Ellentuck*
Affiliation:
Rutgers, The State University and Kyoto University

Extract

Let be a version of class set theory admitting urelemente, and with AC (= axiom of choice) replaced by AC0 (= axiom of choice for sets of finite sets), ω = nonnegative integers, and Δ = Dedekind cardinals. Let be an arbitrarily quantified positive first order sentence in functors for + and ·. Let ƒ0, … , ƒκ - 1 be function variables and the universal sentence obtained from by replacing existential quantifiers by the ƒ1 as Skolem functions.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1970

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