Some algorithmic problems for projective planes

DOI10.1007/BF01982028MaRDI QIDQ1073331zbMATH OpenFDO

Authors B. George

Publication date 1984

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/187286

zbMATH Keywords

Desarguesian projective planesequality problem for Pappian projective planes

Mathematics Subject Classification ID

Desarguesian and Pappian geometries (51A30)

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)].

Recommendations

• Homomorphisms and algorithmic problems in projective planes
• scientific article; zbMATH DE number 56016
• scientific article; zbMATH DE number 1961535
• An algebraic approach to finite projective planes
• Projective Planarity in Linear Time
• Some results of finite projective planes
• Projective planes, graphs, and simple algebras
• The complexity of the isomorphism problem for computable projective planes
• scientific article; zbMATH DE number 617920
• A greedy algorithm to compute arrangements of lines in the projective plane

Cites work

• A nonconstructible projective plane
• A universal algebra approach to free projective planes
• Combinatorial Problems for Skew Fields I. Analogue of Britton's Lemma, and Results of Adjan-Rabin Type
• Die Zulässigkeit der Behandlung mehrsortiger Theorien mittels der üblichen einsortigen Prädikatenlogik
• scientific article; zbMATH DE number 3179163 (Why is no real title available?)
• scientific article; zbMATH DE number 3796704 (Why is no real title available?)
• scientific article; zbMATH DE number 3796705 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3069637 (Why is no real title available?)
• On freely generated projective planes
• Projective Planes
• The solution of a decision problem for several classes of rings
• The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
• The word problem for division rings
• The word problem for free fields
• The word problem for free fields: a correction and an addendum

Cited in

(6)

• Noncomputability of classes of Pappian and Desarguesian projective planes
• scientific article; zbMATH DE number 56016 (Why is no real title available?)
• scientific article; zbMATH DE number 1761890 (Why is no real title available?)
• Construction of some computational algorithms on finite sets of points in the plane
• Complexity of the isomorphism problem for computable free projective planes of finite rank
• Constructively presented projective planes

This page was built for publication: Some algorithmic problems for projective planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073331)