منابع مشابه
Some Theorems on Definability and Decidability
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملDefinability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (resp. equi-column) predicate constraining two time points to belong to the same layer (resp. column) and on the horizontal (resp. vertical) successor predicate relating a tim...
متن کاملRelative decidability and definability in henselian valued fields
Let (K, v) be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map. The main step in obtaining this partition is an answer to the question, given a polynomial f(x) ∈ K[x], what is v(f(x))? Two applications are given: fir...
متن کاملDecidability and Complexity of Definability within the Class of All Partitions
This paper is devoted to exploring modal definability of firstorder sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.
متن کاملFirst Order Decidability and Definability of Integers in Infinite Algebraic Extensions of Rational Numbers
We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show first-order undecidability. In particular, we show that the following propositions hold. (1) For any rational prime q and any positive rational integer m, algebraic integers are definable in any Galois extension of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2013
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl.7804020