443 research outputs found
The Modal Logic of Stepwise Removal
We investigate the modal logic of stepwise removal of objects, both for its
intrinsic interest as a logic of quantification without replacement, and as a
pilot study to better understand the complexity jumps between dynamic epistemic
logics of model transformations and logics of freely chosen graph changes that
get registered in a growing memory. After introducing this logic
() and its corresponding removal modality, we analyze its
expressive power and prove a bisimulation characterization theorem. We then
provide a complete Hilbert-style axiomatization for the logic of stepwise
removal in a hybrid language enriched with nominals and public announcement
operators. Next, we show that model-checking for is
PSPACE-complete, while its satisfiability problem is undecidable. Lastly, we
consider an issue of fine-structure: the expressive power gained by adding the
stepwise removal modality to fragments of first-order logic
Communication in concurrent dynamic logic
AbstractCommunication mechanisms are introduced into the program schemes of Concurrent Dynamic Logic, on both the propositional and the first-order levels. The effects of these mechanisms (particularly, channels, shared variables, and “message collectors”) on issues of expressiveness and decidability are investigated. In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded counting are enabled in the communication scheme
Reasoning about Data Repetitions with Counter Systems
We study linear-time temporal logics interpreted over data words with
multiple attributes. We restrict the atomic formulas to equalities of attribute
values in successive positions and to repetitions of attribute values in the
future or past. We demonstrate correspondences between satisfiability problems
for logics and reachability-like decision problems for counter systems. We show
that allowing/disallowing atomic formulas expressing repetitions of values in
the past corresponds to the reachability/coverability problem in Petri nets.
This gives us 2EXPSPACE upper bounds for several satisfiability problems. We
prove matching lower bounds by reduction from a reachability problem for a
newly introduced class of counter systems. This new class is a succinct version
of vector addition systems with states in which counters are accessed via
pointers, a potentially useful feature in other contexts. We strengthen further
the correspondences between data logics and counter systems by characterizing
the complexity of fragments, extensions and variants of the logic. For
instance, we precisely characterize the relationship between the number of
attributes allowed in the logic and the number of counters needed in the
counter system.Comment: 54 page
An Ansatz for undecidable computation in RNA-world automata
In this Ansatz we consider theoretical constructions of RNA polymers into
automata, a form of computational structure. The basis for transitions in our
automata are plausible RNA-world enzymes that may perform ligation or cleavage.
Limited to these operations, we construct RNA automata of increasing
complexity; from the Finite Automaton (RNA-FA) to the Turing Machine equivalent
2-stack PDA (RNA-2PDA) and the universal RNA-UPDA. For each automaton we show
how the enzymatic reactions match the logical operations of the RNA automaton,
and describe how biological exploration of the corresponding evolutionary space
is facilitated by the efficient arrangement of RNA polymers into a
computational structure. A critical theme of the Ansatz is the self-reference
in RNA automata configurations which exploits the program-data duality but
results in undecidable computation. We describe how undecidable computation is
exemplified in the self-referential Liar paradox that places a boundary on a
logical system, and by construction, any RNA automata. We argue that an
expansion of the evolutionary space for RNA-2PDA automata can be interpreted as
a hierarchical resolution of the undecidable computation by a meta-system (akin
to Turing's oracle), in a continual process analogous to Turing's ordinal
logics and Post's extensible recursively generated logics. On this basis, we
put forward the hypothesis that the resolution of undecidable configurations in
RNA-world automata represents a mechanism for novelty generation in the
evolutionary space, and propose avenues for future investigation of biological
automata
Existential Definability over the Subword Ordering
We study first-order logic (FO) over the structure consisting of finite words over some alphabet A, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is well-understood: If every word is available as a constant, then even the ?? (i.e., existential) fragment is undecidable, already for binary alphabets A.
However, up to now, little is known about the expressiveness of the quantifier alternation fragments: For example, the undecidability proof for the existential fragment relies on Diophantine equations and only shows that recursively enumerable languages over a singleton alphabet (and some auxiliary predicates) are definable.
We show that if |A| ? 3, then a relation is definable in the existential fragment over A with constants if and only if it is recursively enumerable. This implies characterizations for all fragments ?_i: If |A| ? 3, then a relation is definable in ?_i if and only if it belongs to the i-th level of the arithmetical hierarchy. In addition, our result yields an analogous complete description of the ?_i-fragments for i ? 2 of the pure logic, where the words of A^* are not available as constants
- …