The Propositional Lattice of Divisibility and Beal's Conjecture

Alexander Bolotin

doi:10.9734/BJMCS/2017/33315

Research Article Open access CC BY 4.0

The Propositional Lattice of Divisibility and Beal's Conjecture

Alexander Bolotin

Journal of Advances in Mathematics and Computer Science · pp. 1–8 · Published 23 May 2017

10.9734/BJMCS/2017/33315

Abstract

This article is devoted to the lattice-theoretic analysis of Beal's conjecture. We discuss whether this conjecture is deducible from the laws of logic of divisibility.

Beal's conjecture Diophantine equation propositional logic lattice of divisibility

Cited by 0

No indexed citations yet.

Access this article

View at publisher

Cite this article

Alexander Bolotin (2017). The Propositional Lattice of Divisibility and Beal's Conjecture. Journal of Advances in Mathematics and Computer Science , 1–8. https://doi.org/10.9734/BJMCS/2017/33315

Affiliations

Alexander Bolotin — Open University of Israel, Israel.

Metrics

0
Views: 0
Downloads: 0
Citations: 0
Outbound

Full metrics

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.