92 research outputs found
Moving up and down in the generic multiverse
We give a brief account of the modal logic of the generic multiverse, which
is a bimodal logic with operators corresponding to the relations "is a forcing
extension of" and "is a ground model of". The fragment of the first relation is
called the modal logic of forcing and was studied by us in earlier work. The
fragment of the second relation is called the modal logic of grounds and will
be studied here for the first time. In addition, we discuss which combinations
of modal logics are possible for the two fragments.Comment: 10 pages. Extended abstract. Questions and commentary concerning this
article can be made at
http://jdh.hamkins.org/up-and-down-in-the-generic-multiverse
Algorithmic Randomness for Infinite Time Register Machines
A concept of randomness for infinite time register machines (ITRMs),
resembling Martin-L\"of-randomness, is defined and studied. In particular, we
show that for this notion of randomness, computability from mutually random
reals implies computability and that an analogue of van Lambalgen's theorem
holds
Every countable model of set theory embeds into its own constructible universe
The main theorem of this article is that every countable model of set theory
M, including every well-founded model, is isomorphic to a submodel of its own
constructible universe. In other words, there is an embedding that
is elementary for quantifier-free assertions. The proof uses universal digraph
combinatorics, including an acyclic version of the countable random digraph,
which I call the countable random Q-graded digraph, and higher analogues
arising as uncountable Fraisse limits, leading to the hypnagogic digraph, a
set-homogeneous, class-universal, surreal-numbers-graded acyclic class digraph,
closely connected with the surreal numbers. The proof shows that contains
a submodel that is a universal acyclic digraph of rank . The method of
proof also establishes that the countable models of set theory are linearly
pre-ordered by embeddability: for any two countable models of set theory, one
of them is isomorphic to a submodel of the other. Indeed, they are
pre-well-ordered by embedability in order-type exactly .
Specifically, the countable well-founded models are ordered by embeddability in
accordance with the heights of their ordinals; every shorter model embeds into
every taller model; every model of set theory is universal for all
countable well-founded binary relations of rank at most ; and every
ill-founded model of set theory is universal for all countable acyclic binary
relations. Finally, strengthening a classical theorem of Ressayre, the same
proof method shows that if is any nonstandard model of PA, then every
countable model of set theory---in particular, every model of ZFC---is
isomorphic to a submodel of the hereditarily finite sets of . Indeed,
is universal for all countable acyclic binary relations.Comment: 25 pages, 2 figures. Questions and commentary can be made at
http://jdh.hamkins.org/every-model-embeds-into-own-constructible-universe.
(v2 adds a reference and makes minor corrections) (v3 includes further
changes, and removes the previous theorem 15, which was incorrect.
Generalized Effective Reducibility
We introduce two notions of effective reducibility for set-theoretical
statements, based on computability with Ordinal Turing Machines (OTMs), one of
which resembles Turing reducibility while the other is modelled after Weihrauch
reducibility. We give sample applications by showing that certain (algebraic)
constructions are not effective in the OTM-sense and considerung the effective
equivalence of various versions of the axiom of choice
Forcing as a computational process
We investigate how set-theoretic forcing can be seen as a computational
process on the models of set theory. Given an oracle for information about a
model of set theory , we explain senses in which one
may compute -generic filters and the
corresponding forcing extensions . Specifically, from the atomic diagram
one may compute , from the -diagram one may compute and its
-diagram, and from the elementary diagram one may compute the
elementary diagram of . We also examine the information necessary to make
the process functorial, and conclude that in the general case, no such
computational process will be functorial. For any such process, it will always
be possible to have different isomorphic presentations of a model of set theory
that lead to different non-isomorphic forcing extensions . Indeed,
there is no Borel function providing generic filters that is functorial in this
sense.Comment: 26 pages. Inquiries and commentary can be made at
http://jdh.hamkins.org/forcing-as-a-computational-process. Minor updates with
version
Capacity of the Generalized Pulse-Position Modulation Channel
We show the capacity of a generalized pulse-position modulation (PPM) channel, where the input vectors may be any set that allows a transitive group of coordinate permutations, is achieved by a uniform input distribution. We derive a simple expression in terms of the Kullback Leibler distance for the binary case, and the asymptote in the PPM order. We prove a sub-additivity result for the PPM channel and use it to show PPM capacity is monotonic in the order
Self-configurable radio receiver system and method for use with signals without prior knowledge of signal defining characteristics
A method, radio receiver, and system to autonomously receive and decode a plurality of signals having a variety of signal types without a priori knowledge of the defining characteristics of the signals is disclosed. The radio receiver is capable of receiving a signal of an unknown signal type and, by estimating one or more defining characteristics of the signal, determine the type of signal. The estimated defining characteristic(s) is/are utilized to enable the receiver to determine other defining characteristics. This in turn, enables the receiver, through multiple iterations, to make a maximum-likelihood (ML) estimate for each of the defining characteristics. After the type of signal is determined by its defining characteristics, the receiver selects an appropriate decoder from a plurality of decoders to decode the signal
Indestructibility of Vopenka's Principle
We show that Vopenka's Principle and Vopenka cardinals are indestructible
under reverse Easton forcing iterations of increasingly directed-closed partial
orders, without the need for any preparatory forcing. As a consequence, we are
able to prove the relative consistency of these large cardinal axioms with a
variety of statements known to be independent of ZFC, such as the generalised
continuum hypothesis, the existence of a definable well-order of the universe,
and the existence of morasses at many cardinals.Comment: 15 pages, submitted to Israel Journal of Mathematic
- …