Sciweavers

3353 search results - page 1 / 671
» Laver and set theory
Sort
View
AML
2000
71views more  AML 2000»
13 years 7 months ago
Consistency of V = HOD with the wholeness axiom
The Wholeness Axiom (WA) is an axiom schema that can be added to the axioms of ZFC in an extended language {, j}, and that asserts the existence of a nontrivial elementary embeddin...
Paul Corazza
JSYML
1998
61views more  JSYML 1998»
13 years 7 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
APAL
2010
123views more  APAL 2010»
13 years 4 months ago
Classical descriptive set theory as a refinement of effective descriptive set theory
The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it...
Yiannis N. Moschovakis
IJAC
2000
104views more  IJAC 2000»
13 years 7 months ago
Construction of Self-Distributive Operations and Charged Braids
Starting from a certain monoid that describes the geometry of the left self-distributivity identity, we construct an explicit realization of the free left self-distributive system ...
Patrick Dehornoy
JUCS
2010
133views more  JUCS 2010»
13 years 2 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica