Results 11 to 20 of about 491,607 (366)
Decidability via the tilting correspondence [PDF]
Algebra & Number Theory, 2020 We prove relative decidability results for perfectoid fields. This applies to show that the fields $\mathbb{Q}_p(p^{1/p^{\infty}})$ and $\mathbb{Q}_p(\zeta_{p^{\infty}})$ are (existentially) decidable relative to $ \mathbb{F}_p((t))^{1/p^{\infty}}$ and $\
Konstantinos Kartas
semanticscholar +1 more source
Decidability Preservation and Complexity Bounds for Combined Logics
Mathematics, 2022 Transfer theorems for combined logics provide essential tools and insight for reasoning about complex logical systems. In this paper, we present the first sufficient criterion (contextual extensibility) for decidability to be preserved through ...
Carlos Caleiro, Sérgio Marcelino
doaj +1 more source
Philosophies, 2023 The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that ...
Nathan Salmon
doaj +1 more source
Decidability of Definability [PDF]
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011 AbstractFor a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational problem: input are quantifier-free τ-formulas ϕ0, ϕ1, …, ϕn that define relations R0, R1, …, Rn over Γ. The question is whether the relation R0 is primitive positive definable from R1, …, Rn, i.e., definable by a first-order ...
Manuel Bodirsky +2 more
openaire +4 more sources
E-unification by means of tree tuple synchronized grammars [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four ...
Sébastien Limet, Pierre Réty
doaj +1 more source
Kähler moduli stabilization and the propagation of decidability [PDF]
Physical Review D, 2019 Diophantine equations are in general undecidable, yet appear readily in string theory. We demonstrate that numerous classes of Diophantine equations arising in string theory are decidable and propose that decidability may propagate through networks of ...
James Halverson +3 more
semanticscholar +1 more source
Karp-Miller Trees for a Branching Extension of VASS [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study BVASS (Branching VASS) which extend VASS (Vector Addition Systems with States) by allowing addition transitions that merge two configurations. Runs in BVASS are tree-like structures instead of linear ones as for VASS.
Kumar Neeraj Verma +1 more
doaj +3 more sources
On the decidability of reachability in linear time-invariant systems [PDF]
International Conference on Hybrid Systems: Computation and Control, 2018 We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by boolean ...
Nathanaël Fijalkow +4 more
semanticscholar +1 more source
Decidability, complexity, and expressiveness of first-order logic over the subword ordering [PDF]
Logic in Computer Science, 2017 We consider first-order logic over the subword ordering on finite words where each word is available as a constant. Our first result is that the Σ1 theory is undecidable (already over two letters).
Simon Halfon +2 more
semanticscholar +1 more source
DECIDING ON WHAT TO DECIDE [PDF]
International Economic Review, 2017 AbstractWe study two‐stage collective decision‐making procedures where in the first stage, part of the voters decide what issues will be put in the agenda and in the second stage, the whole set of voters decides on the positions to be adopted regarding the issues that are in the agenda.
Barberà, Salvador, Gerber, Anke
openaire +6 more sources