Search
Search Results
-
Boolean Algebras Autostable Relative to n-Decidable Presentations
We give an algebraic description of Boolean algebras autostable relative to n-decidable presentations. Also, autostable I λ,μ -algebras are described.
-
The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas
We construct a decidable prime model in which the degree of a set of complete formulas is equal to 0 ' , infinitely many tuples of elements comply with...
-
On Decidable Categoricity for Almost Prime Models of the Signature of Graphs
AbstractWe study the degrees of decidable categoricity for almost prime models and their relationship with the degrees of the sets of complete...
-
On Decidable Categoricity and Almost Prime Models
AbstractThe complexity of isomorphisms for computable and decidable structures plays an important role in computable model theory. Goncharov [
26 ]... -
Arithmetical Decidability of Homogeneous and Almost Prime Countable Models of Ehrenfeucht Theories with Arithmetical Types
We show that countable homogeneous and almost prime models of Ehrenfeucht theories with arithmetically decidable types are arithmetically decidable.
-
Epistemic Logics with Quantification Over Epistemic Operators: Decidability and Expressiveness
The optimal balance between decidability and expressiveness is a big problem of logical systems, in particular, of quantified epistemic logics...
-
Constructing Decidable Graphs from Decidable Structures
It is shown that every structure (including one in an infinite language) can be transformed into a graph that is bi-interpretable with the original...
-
On Undecidability of Subset Theories of Some Unars
AbstractThis paper is dedicated to studying the algorithmic properties of unars with an injective function. We prove that the theory of every such...
-
Model Theory of the Real Field
We study the model theory of the real field, proving Tarski’s quantifier elimination and decidability results and studying its consequences. We...
-
Rationality is decidable for nearly Euclidean Thurston maps
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound C , there are finitely...
-
Elementary Invariants for Quantified Probability Logic
AbstractLet QPL be the two-sorted probabilistic language proposed in [8], which expands the well-known ‘polynomial’ language described in [3],...
-
On decidability of amenability in computable groups
The main result of the paper states that there is a finitely presented group G with decidable word problem where detection of finite subsets of G ...
-
Model completeness and relative decidability
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for...
-
Primitive recursive decidability for large rings of algebraic integers inside the compositum of all symmetric extensions of ℚ
Let ℚ symm be the compositum of all finite Galois extensions of ℚ with symmetric Galois groups. Denote the absolute Galois group of ℚ by Gal(ℚ). For...
-
Topological Product of Modal Logics with the McKinsey Axiom
AbstractWe consider products of modal logics in topological semantics and prove that the topological product of S4.1 and S4 is the fusion of logics...
-
-
Admissibility and Unification in the Modal Logics Related to S4.2
We study unification and admissibility for an infinite class of modal logics. Conditions superimposed to these logics are to be decidable, Kripke...
-
Onset and Today’s Perspectives of Multilevel Syllogistic
We report on the initial phases of a systematic study (undertaken over forty years ago) on decidable fragments of Set Theory, to which Alfredo Ferro...
-
Every decidable pseudovariety of abelian groups is completely tame
It has been shown that the proper, non-locally finite pseudovarieties of abelian groups are not tame with respect to the canonical signature. In this...