The Line Between Decidability and Undecidability
Polymorphic systems with arrays : decidability and undecidability
... A PSA is polymorphi in the sense that it has a signature, whih onsists of a number of type variables and a number of symbols whose types an be built from the type variables. A signature [r] ...
22
Decidability and Undecidability in stand alone Feature Logics
... We show that feature logics capable of both enforcing re-entrancy and stating linguistic generalisations will have undecid- able satisfiability problems even when most Bo[r] ...
7
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
... We present two decision algorithms which rely on the same idea. The first algorithm is rather practical. The second algorithm is non-deterministic, designed towards low space-complexity, and hence, very theoretical ...
8
Uncomputability and Undecidability in Economic Theory
... and decidability questions take on fully meaningful computational and computable form where one can investi- gate whether it is feasible to instruct a player, who is known to have a winning strategy, to actually ...
36
Decidability Problems for Actor Systems
... U e i is a tuple in {A 1 , . . . , A ℓ , u, e e z} ( e z, z e 1 , · · · , z e ℓ are fresh) there exists 1 ≤ j ≤ ℓ such that Q j is equal to P up-to renaming } Then the corollary follows by Theorem 4.7. We conclude this ...
29
On the undecidability of the limit behavior of Cellular Automata
... To conclude this section we show some easy and well-known decidability results related to stability and the uniqueness of a (subshift) attractor. Proposition 5. It is undecidable whether a cellular automaton is ...
10
A Undecidability of propositional separation logic and its neighbours
... our undecidability results for propositional separation logic seem to be at odds with the decidability of the quantifier-free fragment of a certain separation theory over an infinite heap model, due to ...
41
Non-deterministic Semantics and the Undecidability of Boolean BI
... gave BI a sound and complete labeled tableaux system from which decidability was derived. The logic BI is sometimes called intuitionistic BI to distinguish it with other variants where either the multiplicatives ...
27
The Ultimate Undecidability Result for the Halpern Shoham Logic
... Abstract—The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to clas- sify fragments of this beautiful logic with respect to decidability of its satisfiability ...
10
MoL 2007 15: Decidability of S2S
... Chapter 1 Introduction Leibniz hoped for a calculus of truth in a universal sense. G¨odel showed with his Incompleteness Theorem that such a calculus can not exist. G¨odels result, however, left open which particular ...
60
Decidability of trace equivalence for protocols with nonces
... FIRST DECIDABILITY RESULT Trace equivalence is undecidable in general for an un- bounded number of sessions, inheriting undecidability from the standard secrecy case (see ...obtaining decidability: ...
16
Undecidability of the unification and admissibility problems for modal and description logics
... the decidability status for the concept unification problem for ALC as ...the undecidability of this problem for extensions of ALC with ...mapping between modal and description languages indicated ...
18
Noncomputability, Unpredictability, Undecidability, and Unsolvability in Economic and Finance Theories
... interaction between classical recursion theory and basic Bishop-style constructive analysis, is provided by the demonstration that the foundational result of Computable General Equilibrium Theory, the Uzawa ...
9
The Undecidability of Decision
... tunnel between Elsinore and Helsingborg is to “big”, but we can begin by finding out about the technical possibilities for doing ...distinction between past and future in decision communication is a ...
21
On decidability of a logic of gossips
... for c = a, b. This simply says that the only effect of a call is that the secrets are shared between the two agents involved in it. 3.2 Call Sequences In [1] computations of the gossip protocols were studied, so ...
16
On decidability of concurrent Kleene algebra
... 2 Preliminary definitions 2.1 Pomsets We fix a finite alphabet Σ. A labelled poset is a triple hX, ≤, λi where X is a finite carrier set, ≤ is a partial order on X and the map λ : X → Σ labels every element in X with a ...
16
Undecidability of a weak version of MSO+U
... gaps between consecutive intervals of I have bounded ...in between, we add to J all the positions strictly between x and y, except y − 1, as in Figure ...
16
Randomness, Determinism and Undecidability in the Economic cycle Theory
... [email protected] 08/12/2016. Abstract. The scientific literature that studies the Business cycles contains a historical debate between random and deterministic models. On the one hand, models built with ...
20
Complexity and Decidability in Left Associative Grammar
... The algorithm for recognizing recursions checks whether the current rule, i.e., rule 1, has two predecessors. If so, it checks whether the (abstract) surfaces added by the occurrences of rule 1 are all the same. If so, ...
10
Producing Undecidability: Placing History in the Work of Jacques Rancière
... relationship between artistic production and the formalizing of aesthetic ...oscillates between Rancière's presentation of the concepts of politics and aesthetics and the determination of the distribution ...
89