Results 1 to 10 of about 471,067 (339)
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond [PDF]
Logical Methods in Computer Science, 2022 The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that
Rupak Majumdar +2 more
doaj +3 more sources
Decidability for Sturmian words [PDF]
Logical Methods in Computer Science, 2021 We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of ...
Philipp Hieronymi +5 more
doaj +3 more sources
Decidability Results for the Boundedness Problem [PDF]
Logical Methods in Computer Science, 2014 We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees.
Achim Blumensath +2 more
doaj +3 more sources
The logical strength of B\"uchi's decidability theorem [PDF]
Logical Methods in Computer Science, 2019 We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$.
Leszek Kołodziejczyk +3 more
doaj +3 more sources
Decidability Problems for Actor Systems [PDF]
Logical Methods in Computer Science, 2014 We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness.
Frank De Boer +3 more
doaj +3 more sources
DECIDING ON WHAT TO DECIDE [PDF]
International Economic Review, 2021 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 +5 more sources
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
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
Resynchronized Uniformization and Definability Problems for Rational Relations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations.
Christof Löding, Sarah Winter
doaj +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