Some algorithmic problems for projective planes
type: Item
instance of: scholarly article
title: Some algorithmic problems for projective planes
zbMATH Open document ID: 0588.51002
DOI: 10.1007/BF01982028
author: B. George
published in: Algebra and Logic
publication date: 1984-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/187286
review text: A. I. Shirshov at the 14th All-Union Algebra Conference in 1977 formulated the following question: Is the equality problem for Pappian projective planes and for Desarguesian projective planes algorithmically decidable? Using the results of \textit{A. Macintyre} [J. Symbolic Logic 38, 428-436 (1973; Zbl 0286.02046) and Proc. Lond. Math. Soc., III. Ser. 39, 211-236 (1979; Zbl 0433.16018)] the author of this paper shows that for Pappian projective planes the equality problem is algorithmically decidable and there is a finitely generated Desarguesian projective plane with undecidable equality problem. This work is of interest in connection with the author's earlier works [Algebra Logic 20, 277-282 (1982); translation from Algebra Logika 20, No.4, 419-426 (1981; Zbl 0505.51008) and Algebra Logic 22, 45-47 (1983); translation from Algebra Logika 22, No.1, 61-78 (1983; Zbl 0553.51002)].
reviewed by: K.Burian
Mathematics Subject Classification ID: 51A30
zbMATH DE Number: 3944673
zbMATH Keywords: equality problem for Pappian projective planes
zbMATH Keywords: Desarguesian projective planes
MaRDI profile type: Publication
cites work: Q4741915
cites work: Q4741916
cites work: On freely generated projective planes
cites work: Q5573961
cites work: Q5808757
cites work: The word problem for free fields
cites work: The word problem for free fields: a correction and an addendum
cites work: A nonconstructible projective plane
cites work: Projective Planes
cites work: A universal algebra approach to free projective planes
cites work: The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
cites work: Q3847885
cites work: The word problem for division rings
cites work: Combinatorial Problems for Skew Fields I. Analogue of Britton's Lemma, and Results of Adjan-Rabin Type
cites work: The solution of a decision problem for several classes of rings
cites work: Die Zulässigkeit der Behandlung mehrsortiger Theorien mittels der üblichen einsortigen Prädikatenlogik
Recommended article: Homomorphisms and algorithmic problems in projective planes
Recommended article: Q4006516
Recommended article: Q4418120
Recommended article: An algebraic approach to finite projective planes
Recommended article: Projective Planarity in Linear Time
Recommended article: Some results of finite projective planes
Recommended article: Projective planes, graphs, and simple algebras
Recommended article: Q5398254
Recommended article: Q4302059
Recommended article: A greedy algorithm to compute arrangements of lines in the projective plane
description: scientific article; zbMATH DE number 3944673