| Which mathematical theory best describes real space is an empirical issue, not decidable independently of physical considerations. |
|
| A set of positive integers is decidable if there is an algorithm for determining whether any given positive integer belongs to it. |
|
| There is as yet no warrant for ruling out an arithmetical set that is not decidable, or for ruling out a decidable set that is not arithmetical. |
|
| The aim of this article is to prove that the variety generated by the piecewise testable languages and the band languages is decidable. |
|
| Moreover, the geometries axiomatized in the book have consistent and decidable extensions, namely, Euclidean or hyperbolic geometry over real-closed fields. |
|
| There are uncountably many subsets of N, but since there are only countably many Turing machines, there can be only countably many decidable sets. |
|
| A milestone open problem is to determine whether the equality of sequences generated by such automata is decidable. |
|
| The novelty of OWL-E is that it enhances OWL DL with much more datatype expressiveness and it is still decidable. |
|
| We show that the finite power properly is decidable for rational sets in free group. |
|
| We prove here that the finite power property is decidable for rational sets of the free group. |
|
| We prove that the existence of a coding between two trace monoids is decidable for some families of traces monoids. |
|
| In consequence, it is decidable if a regular language is first-order definable. |
|
| It says that every set of graphs with decidable monadic secondorder theory has bounded clique width. |
|
| If such an algorithm exists, we say that the problem is decidable. |
|
| We investigate decidability problems and prove that some properties that are undecidable for general context-free languages become decidable for XML-languages. |
|
| A problem is considered to be partially decidable, semidecidable, solvable, or provable if A is a recursively enumerable set. |
|
| For Wittgenstein, however, it is a defining feature of a mathematical proposition that it is either decided or decidable by a known decision procedure in a mathematical calculus. |
|
| First, they are all effectively decidable. |
|
| Furthermore, as we have just seen, Wittgenstein rejects PIC as a non-proposition on the grounds that it is not algorithmically decidable, while admitting finitistic versions of PIC because they are algorithmically decidable. |
|
| Any recursively enumerable set which is also co-recursively enumerable is a decidable set. |
|
|
|
| It is easy to show that the set of even numbers is decidable by creating the relevant Turing machine. |
|
| In other words, we show that the pseudovariety generated par J U B, that is to say, the join of the pseudovariety of J-trivial semigroups and of the one of idempotent semigroups, is decidable. |
|
| This problem is decidable for two automatic words. |
|
| Presburger examined this first order theory and proved it is decidable. |
|
