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