183 research outputs found
Absoluteness via Resurrection
The resurrection axioms are forcing axioms introduced recently by Hamkins and
Johnstone, developing on ideas of Chalons and Velickovi\'c. We introduce a
stronger form of resurrection axioms (the \emph{iterated} resurrection axioms
for a class of forcings and a given
ordinal ), and show that implies generic
absoluteness for the first-order theory of with respect to
forcings in preserving the axiom, where is a
cardinal which depends on ( if is any
among the classes of countably closed, proper, semiproper, stationary set
preserving forcings).
We also prove that the consistency strength of these axioms is below that of
a Mahlo cardinal for most forcing classes, and below that of a stationary limit
of supercompact cardinals for the class of stationary set preserving posets.
Moreover we outline that simultaneous generic absoluteness for
with respect to and for with respect to
with is in principle
possible, and we present several natural models of the Morse Kelley set theory
where this phenomenon occurs (even for all simultaneously). Finally,
we compare the iterated resurrection axioms (and the generic absoluteness
results we can draw from them) with a variety of other forcing axioms, and also
with the generic absoluteness results by Woodin and the second author.Comment: 34 page
Decidability and Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of
dynamical systems have flourished since Turing's work. We propose a general
definition of universality that applies to arbitrary discrete time symbolic
dynamical systems. Universality of a system is defined as undecidability of a
model-checking problem. For Turing machines, counter machines and tag systems,
our definition coincides with the classical one. It yields, however, a new
definition for cellular automata and subshifts. Our definition is robust with
respect to initial condition, which is a desirable feature for physical
realizability.
We derive necessary conditions for undecidability and universality. For
instance, a universal system must have a sensitive point and a proper
subsystem. We conjecture that universal systems have infinite number of
subsystems. We also discuss the thesis according to which computation should
occur at the `edge of chaos' and we exhibit a universal chaotic system.Comment: 23 pages; a shorter version is submitted to conference MCU 2004 v2:
minor orthographic changes v3: section 5.2 (collatz functions) mathematically
improved v4: orthographic corrections, one reference added v5:27 pages.
Important modifications. The formalism is strengthened: temporal logic
replaced by finite automata. New results. Submitte
Probabilistic modal {\mu}-calculus with independent product
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for
expressing properties of probabilistic labeled transition systems (PLTS's). Two
equivalent semantics have been studied for this logic, both assigning to each
state a value in the interval [0,1] representing the probability that the
property expressed by the formula holds at the state. One semantics is
denotational and the other is a game semantics, specified in terms of
two-player stochastic parity games. A shortcoming of the probabilistic modal
{\mu}-calculus is the lack of expressiveness required to encode other important
temporal logics for PLTS's such as Probabilistic Computation Tree Logic (PCTL).
To address this limitation we extend the logic with a new pair of operators:
independent product and coproduct. The resulting logic, called probabilistic
modal {\mu}-calculus with independent product, can encode many properties of
interest and subsumes the qualitative fragment of PCTL. The main contribution
of this paper is the definition of an appropriate game semantics for this
extended probabilistic {\mu}-calculus. This relies on the definition of a new
class of games which generalize standard two-player stochastic (parity) games
by allowing a play to be split into concurrent subplays, each continuing their
evolution independently. Our main technical result is the equivalence of the
two semantics. The proof is carried out in ZFC set theory extended with
Martin's Axiom at an uncountable cardinal
Complete Conditional Type Structures
Hierarchies of conditional beliefs (Battigalli and Siniscalchi 1999) play a
central role for the epistemic analysis of solution concepts in sequential
games. They are modelled by type structures, which allow the analyst to
represent the players' hierarchies without specifying an infinite sequence of
conditional beliefs. Here, we study type structures that satisfy a "richness"
property, called completeness. This property is defined on the type structure
alone, without explicit reference to hierarchies of beliefs or other type
structures. We provide sufficient conditions under which a complete type
structure represents all hierarchies of conditional beliefs. In particular, we
present an extension of the main result in Friedenberg (2010) to type
structures with conditional beliefs. KEYWORDS: Conditional probability systems,
hierarchies of beliefs, type structures, completeness, terminality. JEL: C72,
D8
- …