Roger D. Maddux
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Roger D. Maddux has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Robin Hirsch
Department of Computer Science, University College London, London, UK
5 shared publications - Jeremy F. Alm
Lamar University
3 shared publications - Ian Hodkinson
Imperial College London
2 shared publications Richard L. Kramer
2 shared publications- Ian Hodkinson
Imperial College London
1 shared publication - J. Michael Dunn
Indiana University
1 shared publication
Latest Publications
- Open Access
- 13 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2924
Gallai’s Theorem: A Detailed Exposition of Witt’s Proof
Gallai’s theorem states that if the Euclidean plane is colored with finitely many colors then every finite configuration of points admits a monochromatic homothetic copy. This paper presents a detailed exposition of a proof originally published by Ernst Witt in 1952 and subsequently expanded by Alexander Soifer. Additional intermediate steps are supplied throughout, yielding a self-contained and easily verified proof. The argument is formulated recursively through finite configurations associated with a double induction and thereby makes explicit the finite structures underlying the theorem.
- 13 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2924
Open AccessGallai’s Theorem: A Detailed Exposition of Witt’s Proof
Gallai’s theorem states that if the Euclidean plane is colored with finitely many colors then every finite configuration of points admits a monochromatic homothetic copy. This paper presents a detailed exposition of a proof originally published by Ernst Witt in 1952 and subsequently expanded by Alexander Soifer. Additional intermediate steps are supplied throughout, yielding a self-contained and easily verified proof. The argument is formulated recursively through finite configurations associated with a double induction and thereby makes explicit the finite structures underlying the theorem.
- Open Access
- 15 July 2026
- Published by MDPI AG in Preprints.org
Gallai’s Theorem: A Detailed Exposition of Witt’s Proof
Gallai’s theorem states that whenever the Euclidean plane is colored with finitely many colors, every finite configuration of points admits a monochromatic homothetic copy. This paper presents a detailed exposition of a proof originally published by Ernst Witt in 1952 and subsequently expanded by Alexander Soifer. Additional intermediate steps are supplied throughout, yielding a self-contained and mechanically verifiable proof. The argument is formulated recursively through finite configurations associated with a double induction and thereby makes explicit the finite structures underlying the theorem.
- 15 July 2026
- Published by MDPI AG in Preprints.org
Open AccessGallai’s Theorem: A Detailed Exposition of Witt’s Proof
Gallai’s theorem states that whenever the Euclidean plane is colored with finitely many colors, every finite configuration of points admits a monochromatic homothetic copy. This paper presents a detailed exposition of a proof originally published by Ernst Witt in 1952 and subsequently expanded by Alexander Soifer. Additional intermediate steps are supplied throughout, yielding a self-contained and mechanically verifiable proof. The argument is formulated recursively through finite configurations associated with a double induction and thereby makes explicit the finite structures underlying the theorem.
- 2 February 2022
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 126
Monk algebras and Ramsey theory
- 2 February 2022
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 126
Monk algebras and Ramsey theory
- Open Access
Identities Generalizing the Theorems of Pappus and Desargues
The Theorems of Pappus and Desargues (for the projective plane over a field) are generalized here by two identities involving determinants and cross products. These identities are proved to hold in the three-dimensional vector space over a field. They are closely related to the Arguesian identity in lattice theory and to Cayley-Grassmann identities in invariant theory.
Open AccessIdentities Generalizing the Theorems of Pappus and Desargues
The Theorems of Pappus and Desargues (for the projective plane over a field) are generalized here by two identities involving determinants and cross products. These identities are proved to hold in the three-dimensional vector space over a field. They are closely related to the Arguesian identity in lattice theory and to Cayley-Grassmann identities in invariant theory.
- Open Access
Canonical Relativized Cylindric Set Algebras and Weak Associativity
Canonical relativized cylindric set algebras are used to sharpen the relative representation theorem for weakly associative relation algebras, that every complete atomic weakly associative relation algebra is isomorphic with the relativization of a set relation algebra to a symmetric and reflexive binary relation, by insuring that the atoms of the set relation algebra and its relativization are orbits of single sequences under a group of permutations of the underlying set. This sharpening of the relative representation theorem was first proved for the Resek-Thompson Theorem in 1989.
Open AccessCanonical Relativized Cylindric Set Algebras and Weak Associativity
Canonical relativized cylindric set algebras are used to sharpen the relative representation theorem for weakly associative relation algebras, that every complete atomic weakly associative relation algebra is isomorphic with the relativization of a set relation algebra to a symmetric and reflexive binary relation, by insuring that the atoms of the set relation algebra and its relativization are orbits of single sequences under a group of permutations of the underlying set. This sharpening of the relative representation theorem was first proved for the Resek-Thompson Theorem in 1989.
- 1 June 2021
- Published by Springer Nature
- p. 313-345
Canonical Relativized Cylindric Set Algebras and Weak Associativity
- 1 June 2021
- Published by Springer Nature
- p. 313-345
Canonical Relativized Cylindric Set Algebras and Weak Associativity
- Open Access
Formulas generalizing Pappus and Desargues
The Theorems of Pappus and Desargues are generalized by two special formulas that hold in the three-dimensional vector space over a field.
Open AccessFormulas generalizing Pappus and Desargues
The Theorems of Pappus and Desargues are generalized by two special formulas that hold in the three-dimensional vector space over a field.
- Open Access
Tarskian classical relevant logic
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of Set Theory without Variables, and summarized in first nine sections. TR is closely related to the well-known logic KR. Every formula of relevance logic has a corresponding sentence in Tarski's extended first-order logic of binary relations with operators on the relation symbols. A formula is in TR (by definition), or in KR (by a theorem), if and only if its corresponding sentence can be proved in first-order logic, using at most four variables, from the assumptions that all binary relations are dense and, for TR, commute under composition, or, for KR, are symmetric. The vocabulary of TR is the same as the classical relevant logic CR$^*$ proposed by Meyer and Routley but TR properly contains CR$^*$. The frames characteristic for TR are the ones that are characteristic for CR$^*$ and satisfy an extra frame condition. There are formulas in TR (but not in CR$^*$) that correspond to this frame condition and provide a counterexample to a theorem of T. Kowalski. The frames characteristic for TR, or KR, are the ones whose complex algebras are integral dense relation algebras that are commutative, or symmetric, respectively. For both classes, the number of isomorphism types grows like the number of isomorphism types of ternary relations. Asymptotic formulas are obtained for both classes. Similar results apply to a hierarchy of logics defined by the number of variables used in the first-order proofs of their corresponding sentences.
Open AccessTarskian classical relevant logic
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of Set Theory without Variables, and summarized in first nine sections. TR is closely related to the well-known logic KR. Every formula of relevance logic has a corresponding sentence in Tarski's extended first-order logic of binary relations with operators on the relation symbols. A formula is in TR (by definition), or in KR (by a theorem), if and only if its corresponding sentence can be proved in first-order logic, using at most four variables, from the assumptions that all binary relations are dense and, for TR, commute under composition, or, for KR, are symmetric. The vocabulary of TR is the same as the classical relevant logic CR$^*$ proposed by Meyer and Routley but TR properly contains CR$^*$. The frames characteristic for TR are the ones that are characteristic for CR$^*$ and satisfy an extra frame condition. There are formulas in TR (but not in CR$^*$) that correspond to this frame condition and provide a counterexample to a theorem of T. Kowalski. The frames characteristic for TR, or KR, are the ones whose complex algebras are integral dense relation algebras that are commutative, or symmetric, respectively. For both classes, the number of isomorphism types grows like the number of isomorphism types of ternary relations. Asymptotic formulas are obtained for both classes. Similar results apply to a hierarchy of logics defined by the number of variables used in the first-order proofs of their corresponding sentences.
- Open Access
Relation algebras of Sugihara, Belnap, Meyer, and Church
Algebras introduced by, or attributed to, Sugihara, Belnap, Meyer, and Church are representable as algebras of binary relations with set-theoretically defined operations. They are definitional reducts or subreducts of proper relation algebras. The representability of Sugihara matrices yields sound and complete set-theoretical semantics for R-mingle.
Open AccessRelation algebras of Sugihara, Belnap, Meyer, and Church
Algebras introduced by, or attributed to, Sugihara, Belnap, Meyer, and Church are representable as algebras of binary relations with set-theoretically defined operations. They are definitional reducts or subreducts of proper relation algebras. The representability of Sugihara matrices yields sound and complete set-theoretical semantics for R-mingle.