Some applications of the notions of forcing and generic sets
From MaRDI portal
Publication:5338333
DOI10.4064/fm-56-3-325-345zbMath0129.26401MaRDI QIDQ5338333
Publication date: 1965
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213821
03Exx: Set theory
Related Items
HIGHER RANDOMNESS AND GENERICITY, IN MEMORIAM: SOLOMON FEFERMAN (1928–2016), ITERATING SYMMETRIC EXTENSIONS, MINIMAL AXIOMATIC FRAMEWORKS FOR DEFINABLE HYPERREALS WITH TRANSFER, The Discovery of My Completeness Proofs, An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited, Spectra of uniformity, Feferman’s Skepticism About Set Theory, Classes of Polish spaces under effective Borel isomorphism, Measure-theoretic uniformity, The Forcing Method and the Upper Semilattice of Hyperdegrees, Measure-Theoretic Uniformity in Recursion Theory and Set Theory, On Hausdorff operators in ZF$\mathsf {ZF}$, A note on the enumeration degrees of 1-generic sets, Implicit definability in arithmetic, Undefinability of truth and nonstandard models, A representative individual from Arrovian aggregation of parametric individual utilities, Higher Kurtz randomness, Paul Cohen and forcing in 1963, Generic degrees are complemented, The universal theory of first order algebras and various reducts, Parametrization over inductive relations of a bounded number of variables, When is arithmetic possible?, Lowness of higher randomness notions, The lack of definable witnesses and provably recursive functions in intuitionistic set theories, Countable admissible ordinals and hyperdegrees, Generic oracles, uniform machines, and codes, Symmetric submodels of a Cohen generic extension, On some new metamathematical results concerning set theory, Infinite coforcing in model theory, ZF and Boolean algebra, On the independence of core-equivalence results from Zermelo-Fraenkel set theory, Kinna-Wagner selection principles, axioms of choice and multiple choice, An oracle builder's toolkit, Arrovian aggregation of generalised expected-utility preferences: (im)possibility results by means of model theory, Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem, On the elimination of imaginaries from certain valued fields, Degrees of Dowd-type generic oracles, Complexity of the \(r\)-query tautologies in the presence of a generic oracle, A contextual-hierarchical approach to truth and the liar paradox, Separating weak \(\alpha\)-change and \(\alpha\)-change genericity, Partially definable forcing and bounded arithmetic, The Rado path decomposition theorem, Levy and set theory, On the reducibility of \(\Pi_ 1^ 1\) sets, Typical forcings, NP search problems and an extension of a theorem of Riis, Measure-theoretic applications of higher Demuth’s Theorem, On the Existence of Free Ultrafilters on ω and on Russell-sets in ZF, Hyperarithmetical Sets, Amorphe Potenzen kompakter Räume, AN APPLICATION OF RECURSION THEORY TO ANALYSIS, Countable compact Hausdorff spaces need not be metrizable in ZF, Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic, Lusin Sets and Well Ordering the Continuum
