{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:53:32Z","timestamp":1782928412864,"version":"3.54.5"},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":5763,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1998,6]]},"abstract":"<jats:p>The purpose of these notes is to describe an absoluteness principle due to Jacques Stern and discuss some applications to the general study of Borel sets. This paper will not be engaged in independence results, but in proving outright theorems about the Borel hierarchy.<\/jats:p><jats:p>Roughly speaking, Stern's absoluteness principle states that if a certain <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0022481200015152_inline1.png\"\/> set can be introduced into the <jats:italic>universe<\/jats:italic> by <jats:italic>forcing<\/jats:italic>, then it can be introduced by some <jats:italic>small forcing notion<\/jats:italic>.<\/jats:p><jats:p>The notation <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0022481200015152_inline1.png\"\/>, and so on, will be defined in Section 1; this gives a notational system for describing the complexity of Borel sets beyond <jats:italic>F<\/jats:italic><jats:sub>\u03c3<\/jats:sub> or <jats:italic>G<\/jats:italic><jats:sub>\u03b4<\/jats:sub>. The \u201cuniverse\u201d refers to the totality of all sets. \u201cForcing\u201d refers to Paul Cohen's technique for, in some sense, changing this totality by the introduction of new sets. Here \u201csmall\u201d means relatively small cardinality.<\/jats:p><jats:p>The size of this small forcing notion is roughly the ath iteration of the power set operation. Just to get an idea of what this theorem might be saying, we can argue that under certain conditions, if a closed set can be introduced by forcing, then it exists already. There are a number of other qualifications that need to be made to this rough description, and we will come to them later.<\/jats:p><jats:p>Unlike, say, Shoenfield absoluteness, Stern's absoluteness can only be made understood in the terminology of forcing. Since forcing is typically associated with the pursuit of independence results, we could easily assume that Stern's work has little relevance in proving positive theorems about the Borel hierarchy.<\/jats:p><jats:p>However, this would be untrue. Using abstract and indirect metamathematical arguments, and availing ourselves of Stern's absoluteness principle, we will prove a string of ZFC theorems for which no direct proof is known.<\/jats:p>","DOI":"10.2307\/2586857","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:01:17Z","timestamp":1146938477000},"page":"663-693","source":"Crossref","is-referenced-by-count":13,"title":["An absoluteness principle for Borel sets"],"prefix":"10.1017","volume":"63","author":[{"given":"Greg","family":"Hjorth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200015152_ref001","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735264"},{"key":"S0022481200015152_ref016","first-page":"1273","volume":"49","author":"Sami","year":"1984","journal-title":"On  equivalence relations with Borel classes of bounded rank"},{"key":"S0022481200015152_ref005","first-page":"685","volume":"43","author":"Harrington","year":"1978","journal-title":"Analytic determinacy and 0#"},{"key":"S0022481200015152_ref014","first-page":"86","volume-title":"Cabal seminar 79\u201381","author":"Martin"},{"key":"S0022481200015152_ref015","volume-title":"Descriptive set theory","author":"Moschovakis","year":"1980"},{"key":"S0022481200015152_ref012","unstructured":"Martin, D. A. , Determinacy, unpublished manuscript."},{"key":"S0022481200015152_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(70)90009-4"},{"key":"S0022481200015152_ref020","doi-asserted-by":"publisher","DOI":"10.2307\/1970696"},{"key":"S0022481200015152_ref019","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1995-1311918-2"},{"key":"S0022481200015152_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(81)90021-9"},{"key":"S0022481200015152_ref002","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1979.28.28024"},{"key":"S0022481200015152_ref021","doi-asserted-by":"publisher","DOI":"10.2307\/2007070"},{"key":"S0022481200015152_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760459"},{"key":"S0022481200015152_ref007","first-page":"491","article-title":"Undecidable and decidable properties of constituents","volume":"124","author":"Kanovei","year":"1984","journal-title":"Mathematics of USSR Sbornik"},{"key":"S0022481200015152_ref008","unstructured":"Kechris, A. S. , Polish group actions and definable equivalence relations, unpublished manuscript, 1994."},{"key":"S0022481200015152_ref011","first-page":"301","volume":"46","author":"Makkai","year":"1981","journal-title":"An example concerning Scott heights"},{"key":"S0022481200015152_ref017","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1994-1022169-2"},{"key":"S0022481200015152_ref009","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-97-00221-X"},{"key":"S0022481200015152_ref010","first-page":"363","article-title":"A separation theorem for  sets","volume":"260","author":"Louveau","year":"1980","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200015152_ref006","first-page":"1273","volume":"60","author":"Hjorth","year":"1995","journal-title":"Analytic equivalence relations and Ulm-type classifications"},{"key":"S0022481200015152_ref018","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(80)90002-9"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200015152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T12:17:08Z","timestamp":1628597828000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200015152\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0022481200015152"],"URL":"https:\/\/doi.org\/10.2307\/2586857","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}