for Journals by Title or ISSN for Articles by Keywords help

Publisher: Springer-Verlag (Total: 2354 journals)

 Algebra and Logic   [SJR: 0.566]   [H-I: 18]   [4 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1573-8302 - ISSN (Online) 0002-5232    Published by Springer-Verlag  [2354 journals]
• Sessions of the Seminar “Algebra i Logika”
• Pages: 178 - 179
PubDate: 2017-05-01
DOI: 10.1007/s10469-017-9438-5
Issue No: Vol. 56, No. 2 (2017)

• Sessions of the Seminar “Algebra i Logika”
• PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9456-3

• Fragments of Functional Clones
• Authors: A. G. Pinus
Abstract: In [1] we came up with some approach and problems associated with subsets of functional clones on a fixed set that consist of functions occurring in a clone with a fixed restriction on their arity. This approach receives further development.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9452-7

• P -Stable Polygons
• Authors: A. A. Stepanova; D. O. Ptakhov
Abstract: P-stable polygons are studied. It is proved that the property of being (P, s)-, (P, a)-, and (P, e)-stable for the class of all polygons over a monoid S is equivalent to S being a group. We describe the structure of (P, s)-, (P, a)-, and (P, e)-stable polygons SA over a countable left zero monoid S and, under the condition that the set A \ SA is indiscernible, over a right zero monoid.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9453-6

• Algebraic Geometry Over Algebraic Structures. VI. Geometrical Equivalence
• Authors: E. Yu. Daniyarova; A. G. Myasnikov; V. N. Remeslennikov
Abstract: The present paper is one in our series of works on algebraic geometry over arbitrary algebraic structures, which focuses on the concept of geometrical equivalence. This concept signifies that for two geometrically equivalent algebraic structures $$\mathcal{A}$$ and ℬ of a language L, the classification problems for algebraic sets over $$\mathcal{A}$$ and ℬ are equivalent. We establish a connection between geometrical equivalence and quasiequational equivalence.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9449-2

• Reducibility of Computable Metrics on the Real Line
• Authors: R. A. Kornev
Abstract: We study computable reducibility of computable metrics on R induced by reducibility of their respective Cauchy representations. It is proved that this ordering has a subordering isomorphic to an arbitrary countable tree. Also we introduce a weak version of computable reducibility and construct a countable antichain of computable metrics that are incomparable with respect to it. Informally, copies of the real line equipped with these metrics are pairwise homeomorphic but not computably homeomorphic.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9451-8

• Automorphism Groups of Small Distance-Regular Graphs
• Authors: I. N. Belousov; A. A. Makhnev
Abstract: We consider undirected graphs without loops and multiple edges. Previously, V. P. Burichenko and A. A. Makhnev [1] found intersection arrays of distance-regular locally cyclic graphs with the number of vertices at most 1000. It is shown that the automorphism group of a graph with intersection array {15, 12, 1; 1, 2, 15}, {35, 32, 1; 1, 2, 35}, {39, 36, 1; 1, 2, 39}, or {42, 39, 1; 1, 3, 42} (such a graph enters the above-mentioned list) acts intransitively on the set of its vertices.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9447-4

• Universal Generalized Computable Numberings and Hyperimmunity
• Authors: M. Kh. Faizrakhmanov
Abstract: Generalized computable numberings relative to hyperimmune and high oracles are studied. We give a description of oracles relative to which every finite computable family has a universal computable numbering. Also we present a characterization of the class of oracles relative to which every universal computable numbering of an arbitrary finite family is precomplete, and establish a sufficient condition for universal generalized computable numberings to be precomplete. In addition, we look into the question on limitedness of universal numberings computable relative to high oracles.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9454-5

• Automorphism Groups of Diagonal Z p -Forms of the Lie Algebra sl 2 ( Q p
), p &gt; 2
• Authors: A. N. Grishkov; M. N. Rasskazova
Abstract: It follows from [2] that two nondiagonal forms like S(n, d) + Z p A and S(n, d) + Z p A ′ are isomorphic if the elements of A and A′ are conjugated via the group $${\mathrm{Aut}}_{{\boldsymbol{Z}}_p}S\left(n,d\right)$$ . In the present paper, we settle just this question on conjugation. In other words, we describe the group $${\mathrm{Aut}}_{{\boldsymbol{Z}}_p}S\left(n,d\right)$$ and clarify under which conditions two elements of S(n, d) are conjugate under the action of this group on S(n, d), p > 2.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9448-3

• Elementary Equivalence of Partially Commutative Lie Rings and Algebras
• Authors: E. N. Poroshenko
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9455-4

• Solimit Points and u -Extensions
• Authors: Yu. L. Ershov
Abstract: We give a characterization of u-extensions of topological T0-spaces and also of sober spaces using a new concept of a solimit point. It is shown that the sobrification of an arbitrary T0-space coincides with its greatest u-extension.
PubDate: 2017-11-07
DOI: 10.1007/s10469-017-9450-9

• Sessions of the Seminar “Algebra i Logika”
• PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9446-5

• The Isomorphism Problem for Generalized Baumslag–Solitar Groups with
One Mobile Edge
• Authors: F. A. Dudkin
Abstract: A generalized Baumslag–Solitar group (GBS group) is a finitely generated group G which acts on a tree with all edge and vertex stabilizers infinite cyclic. Every GBS group is the fundamental group π1(ð”¸) of some labeled graph ð”¸. This paper deals with the isomorphism problem for GBS groups, which is the problem of determining whether π1(ð”¸) ≅ π1(ð”¹) for two given labeled graphs ð”¸ and ð”¹. We describe an algorithm that decides this problem for the case where one of the labeled graphs has a sole mobile edge.
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9440-y

• Recognizable and Perceptible Logics and Varieties
• Authors: L. L. Maksimova
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9444-7

• Generic Gӧdel’s Incompleteness Theorem
• Authors: A. N. Rybalov
Abstract: Gӧdel’s incompleteness theorem asserts that if formal arithmetic is consistent then there exists an arithmetic statement such that neither the statement nor its negation can be deduced from the axioms of formal arithmetic. Previously [3], it was proved that formal arithmetic remains incomplete if, instead of the set of all arithmetic statements, we consider any set of some class of “almost all” statements (the class of so-called strongly generic subsets). This result is strengthened as follows: formal arithmetic is incomplete for any generic subset of arithmetic statements (i.e., a subset of asymptotic density 1).
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9442-9

• Constants of Partial Derivations and Primitive Operations
• Authors: S. V. Pchelintsev; I. P. Shestakov
Abstract: We describe algebras of constants of the set of all partial derivations in free algebras of unitarily closed varieties over a field of characteristic 0. These constants are also called proper polynomials. It is proved that a subalgebra of proper polynomials coincides with the subalgebra generated by values of commutators and Umirbaev–Shestakov primitive elements pm,n on a set of generators for a free algebra. The space of primitive elements is a linear algebraic system over a signature Σ = {[x, y], pm,n m, n ≥ 1}. We point out bases of operations of the set Σ in the classes of all algebras, all commutative algebras, right alternative and Jordan algebras.
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9441-x

• Solvability of Equations in Classes of Solvable Groups and Lie Algebras
• Authors: V. A. Roman’kov
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9445-6

• Decompositions in Complete Lattices II. Replaceable Irredundant
Decompositions
• Authors: M. V. Schwidefsky
Abstract: A characterization of lattices with replaceable irredundant decompositions is given in the following six classes: the class of upper and lower continuous lattices; the class of upper continuous completely join-semidistributive lattices; the class of upper semimodular lower continuous lattices; the class of upper semimodular completely joinsemidistributive lattices; the class of consistent lower continuous lattices; the class of consistent completely join-semidistributive lattices.
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9443-8

• Irreducible, Singular, and Contiguous Degrees
• Authors: I. I. Batyrshin
Abstract: We study structures of degrees of stronger algorithmic reducibilities inside the degrees of weaker algorithmic ones. Results in this area are reviewed for algorithmic reducibilities m-, 1-, tt-, wtt-, T-, e-, s-, Q-, and we formulate questions that are still not settled for these. A computably enumerable Q-degree which consists of one computably enumerable m-degree is constructed.
PubDate: 2017-10-05
DOI: 10.1007/s10469-017-9439-4

• Universal Invariants for Classes of Abelian Groups
• Authors: A. A. Mishchenko; V. N. Remeslennikov; A. V. Treier
Abstract: We prove an analog of Szmielew’s theorem for universal equivalence of Abelian groups.
PubDate: 2017-07-08
DOI: 10.1007/s10469-017-9434-9

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327

Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs