4,594 research outputs found

    The Isomorphism Relation Between Tree-Automatic Structures

    Get PDF
    An ω\omega-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for ω\omega-tree-automatic structures. We prove first that the isomorphism relation for ω\omega-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n >1) is not determined by the axiomatic system ZFC. Then we prove that the isomorphism problem for ω\omega-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n >1) is neither a Σ21\Sigma_2^1-set nor a Π21\Pi_2^1-set

    Satisfiability in multi-valued circuits

    Full text link
    Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is strictly connected with the problems of solving equations (or systems of equations) over finite algebras. The research reported in this work was motivated by a desire to know for which finite algebras A\mathbf A there is a polynomial time algorithm that decides if an equation over A\mathbf A has a solution. We are also looking for polynomial time algorithms that decide if two circuits over a finite algebra compute the same function. Although we have not managed to solve these problems in the most general setting we have obtained such a characterization for a very broad class of algebras from congruence modular varieties. This class includes most known and well-studied algebras such as groups, rings, modules (and their generalizations like quasigroups, loops, near-rings, nonassociative rings, Lie algebras), lattices (and their extensions like Boolean algebras, Heyting algebras or other algebras connected with multi-valued logics including MV-algebras). This paper seems to be the first systematic study of the computational complexity of satisfiability of non-Boolean circuits and solving equations over finite algebras. The characterization results provided by the paper is given in terms of nice structural properties of algebras for which the problems are solvable in polynomial time.Comment: 50 page

    A Hierarchy of Tree-Automatic Structures

    Get PDF
    We consider ωn\omega^n-automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ωn\omega^n for some integer n1n\geq 1. We show that all these structures are ω\omega-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω2\omega^2-automatic (resp. ωn\omega^n-automatic for n>2n>2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) is not determined by the axiomatic system ZFC. We infer from the proof of the above result that the isomorphism problem for ωn\omega^n-automatic boolean algebras, n>1n > 1, (respectively, rings, commutative rings, non commutative rings, non commutative groups) is neither a Σ21\Sigma_2^1-set nor a Π21\Pi_2^1-set. We obtain that there exist infinitely many ωn\omega^n-automatic, hence also ω\omega-tree-automatic, atomless boolean algebras BnB_n, n1n\geq 1, which are pairwise isomorphic under the continuum hypothesis CH and pairwise non isomorphic under an alternate axiom AT, strengthening a result of [FT10].Comment: To appear in The Journal of Symbolic Logic. arXiv admin note: substantial text overlap with arXiv:1007.082

    A single identity for Boolean groups and Boolean rings

    Get PDF
    AbstractBy a well-known result of Higman and Neumann, Boolean groups (i.e., groups of exponent 2) can be represented as the class of groupoids which satisfy a single identity. In this paper we find all minimal length single identities which characterize Boolean groups and represent Boolean rings (associative rings with unit satisfying x2 = x) as the class of algebras with three operations and satisfying a single identity

    Idempotent generated algebras and Boolean powers of commutative rings

    Full text link
    A Boolean power S of a commutative ring R has the structure of a commutative R-algebra, and with respect to this structure, each element of S can be written uniquely as an R-linear combination of orthogonal idempotents so that the sum of the idempotents is 1 and their coefficients are distinct. In order to formalize this decomposition property, we introduce the concept of a Specker R-algebra, and we prove that the Boolean powers of R are up to isomorphism precisely the Specker R-algebras. We also show that these algebras are characterized in terms of a functorial construction having roots in the work of Bergman and Rota. When R is indecomposable, we prove that S is a Specker R-algebra iff S is a projective R-module, thus strengthening a theorem of Bergman, and when R is a domain, we show that S is a Specker R-algebra iff S is a torsion-free R-module. For an indecomposable R, we prove that the category of Specker R-algebras is equivalent to the category of Boolean algebras, and hence is dually equivalent to the category of Stone spaces. In addition, when R is a domain, we show that the category of Baer Specker R-algebras is equivalent to the category of complete Boolean algebras, and hence is dually equivalent to the category of extremally disconnected compact Hausdorff spaces. For a totally ordered R, we prove that there is a unique partial order on a Specker R-algebra S for which it is an f-algebra over R, and show that S is equivalent to the R-algebra of piecewise constant continuous functions from a Stone space X to R equipped with the interval topology.Comment: 18 page
    corecore