Matthew Spinks
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Matthew Spinks has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Robert Veroff
University of New Mexico
4 shared publications - Francesco Paoli
Consiglio per la Ricerca in Agricoltura e L’analisi Dell’economia Agraria (CREA), Centro di Ricerca Difesa e Certificazione (CREA DC), Cascine del Riccio, Via Lanciola 12/a, 50125 Firenze, Italy
2 shared publications - Jonathan Leech
Westmont College
2 shared publications - Robert J. Bignall
Sunway University, Malaysia
2 shared publications - Thiago Nascimento
Universidade Federal do Rio Grande do Norte
2 shared publications - Umberto Rivieccio
UNED
2 shared publications
Latest Publications
- Open Access
- 30 December 2019
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 2 (2) , #P2.08
Dual binary discriminator varieties
Left normal bands, strongly distributive skew lattices, implicative BCS-algebras, skew Boolean algebras, skew Boolean intersection algebras, and certain other non-commutative structures occur naturally as term reducts in the study of ternary discriminator algebras and the varieties that they generate, giving rise thereby to various classes of pointed discriminator varieties that generalise the class of pointed ternary discriminator varieties. For each such class of varieties there is a corresponding pointed discriminator function that generalises the ternary discriminator. In this paper some of the classes of pointed discriminator varieties that are contained in the class of dual binary discriminator varieties are characterised. A key unifying property is that the principal ideals of an algebra in a dual binary discriminator variety are entirely determined by the dual binary discriminator term for that variety.
- 30 December 2019
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 2 (2) , #P2.08
Open AccessDual binary discriminator varieties
Left normal bands, strongly distributive skew lattices, implicative BCS-algebras, skew Boolean algebras, skew Boolean intersection algebras, and certain other non-commutative structures occur naturally as term reducts in the study of ternary discriminator algebras and the varieties that they generate, giving rise thereby to various classes of pointed discriminator varieties that generalise the class of pointed ternary discriminator varieties. For each such class of varieties there is a corresponding pointed discriminator function that generalises the ternary discriminator. In this paper some of the classes of pointed discriminator varieties that are contained in the class of dual binary discriminator varieties are characterised. A key unifying property is that the principal ideals of an algebra in a dual binary discriminator variety are entirely determined by the dual binary discriminator term for that variety.
- 3 November 2018
- Published by Springer Nature in Soft Computing
- Vol. 23 (7) , 2297-2320
Compatibly involutive residuated lattices and the Nelson identity
- 3 November 2018
- Published by Springer Nature in Soft Computing
- Vol. 23 (7) , 2297-2320
Compatibly involutive residuated lattices and the Nelson identity
- Open Access
Algebraic Semantics for Nelson's Logic S
Besides the better-known Nelson's Logic and Paraconsistent Nelson's Logic, in "Negation and separation of concepts in constructive systems" (1959), David Nelson introduced a logic called S with the aim of analyzing the constructive content of provable negation statements in mathematics. Motivated by results from Kleene, in "On the Interpretation of Intuitionistic Number Theory" (1945), Nelson investigated a more symmetric recursive definition of truth, according to which a formula could be either primitively verified or refuted. The logic S was defined by means of a calculus lacking the contraction rule and having infinitely many schematic rules, and no semantics was provided. This system received little attention from researchers and it even remained unnoticed that on its original presentation it was inconsistent. Fortunately, the inconsistency was caused by typos and by a rule whose hypothesis and conclusion were swapped.We investigate in the present study a corrected version of the logic S, and focus at its propositional fragment, showing that it is algebraizable (in fact, implicative) with respect to a certain special class of involutive residuated lattices. We thus introduce the first (algebraic) semantics for S as well as a finite Hilbert-style calculus equivalent to Nelson's presentation. We also compare S with the other two above-mentioned logics of the Nelson family.
Open AccessAlgebraic Semantics for Nelson's Logic S
Besides the better-known Nelson's Logic and Paraconsistent Nelson's Logic, in "Negation and separation of concepts in constructive systems" (1959), David Nelson introduced a logic called S with the aim of analyzing the constructive content of provable negation statements in mathematics. Motivated by results from Kleene, in "On the Interpretation of Intuitionistic Number Theory" (1945), Nelson investigated a more symmetric recursive definition of truth, according to which a formula could be either primitively verified or refuted. The logic S was defined by means of a calculus lacking the contraction rule and having infinitely many schematic rules, and no semantics was provided. This system received little attention from researchers and it even remained unnoticed that on its original presentation it was inconsistent. Fortunately, the inconsistency was caused by typos and by a rule whose hypothesis and conclusion were swapped.We investigate in the present study a corrected version of the logic S, and focus at its propositional fragment, showing that it is algebraizable (in fact, implicative) with respect to a certain special class of involutive residuated lattices. We thus introduce the first (algebraic) semantics for S as well as a finite Hilbert-style calculus equivalent to Nelson's presentation. We also compare S with the other two above-mentioned logics of the Nelson family.
- 21 March 2018
- Published by Springer Nature
- p. 323-379
Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- 21 March 2018
- Published by Springer Nature
- p. 323-379
Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- 9 September 2016
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 102 (2) , 290-306
VARIETIES OF SKEW BOOLEAN ALGEBRAS WITH INTERSECTIONS
Skew Boolean algebras for which pairs of elements have natural meets, called intersections, are studied from a universal algebraic perspective. Their lattice of varieties is described and shown to coincide with the lattice of quasi-varieties. Some connections of relevance to arbitrary skew Boolean algebras are also established.
- 9 September 2016
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 102 (2) , 290-306
VARIETIES OF SKEW BOOLEAN ALGEBRAS WITH INTERSECTIONS
Skew Boolean algebras for which pairs of elements have natural meets, called intersections, are studied from a universal algebraic perspective. Their lattice of varieties is described and shown to coincide with the lattice of quasi-varieties. Some connections of relevance to arbitrary skew Boolean algebras are also established.
- Open Access
- 11 November 2014
- Published by Victoria University of Wellington Library in The Australasian Journal of Logic
- Vol. 11 (2)
Discriminator logics (Research announcement)
A discriminator logic is the 1-assertional logic of a discriminator variety V having two constant terms 0 and 1 such that V |= 0 ≈ 1 iff every member of V is trivial. Examples of such logics abound in the literature. The main result of this research announcement asserts that a certain non-Fregean deductive system SBPC, which closely resembles the classical propositional calculus, is canonical for the class of discriminator logics in the sense that any discriminator logic S can be presented (up to definitional equivalence) as an axiomatic extension of SBPC by a set of extensional logical connectives taken from the language of S. The results outlined in this research announcement are extended to several generalisations of the class of discriminator logics in the main work.
- 11 November 2014
- Published by Victoria University of Wellington Library in The Australasian Journal of Logic
- Vol. 11 (2)
Open AccessDiscriminator logics (Research announcement)
A discriminator logic is the 1-assertional logic of a discriminator variety V having two constant terms 0 and 1 such that V |= 0 ≈ 1 iff every member of V is trivial. Examples of such logics abound in the literature. The main result of this research announcement asserts that a certain non-Fregean deductive system SBPC, which closely resembles the classical propositional calculus, is canonical for the class of discriminator logics in the sense that any discriminator logic S can be presented (up to definitional equivalence) as an axiomatic extension of SBPC by a set of extensional logical connectives taken from the language of S. The results outlined in this research announcement are extended to several generalisations of the class of discriminator logics in the main work.
- 1 December 2011
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 76 (4) , 1261-1286
Quasi-subtractive varieties
Varieties like groups, rings, or Boolean algebras have the property that, in any of their members, the lattice of congruences is isomorphic to a lattice of more manageable objects, for example normal subgroups of groups, two-sided ideals of rings, filters (or ideals) of Boolean algebras. Abstract algebraic logic can explain these phenomena at a rather satisfactory level of generality: in every memberAof aτ-regular varietythe lattice of congruences ofAis isomorphic to the lattice of deductive filters onAof theτ-assertional logic of. Moreover, ifhas a constant 1 in its type and is 1-subtractive, the deductive filters onA∈of the 1-assertional logic ofcoincide with the-ideals ofAin the sense of Gumm and Ursini, for which we have a manageable concept of ideal generation.However, there are isomorphism theorems, for example, in the theories of residuated lattices, pseudointerior algebras and quasi-MV algebras that cannot be subsumed by these general results. The aim of the present paper is to appropriately generalise the concepts of subtractivity andτ-regularity in such a way as to shed some light on the deep reason behind such theorems. The tools and concepts we develop hereby provide a common umbrella for the algebraic investigation of several families of logics, including substructural logics, modal logics, quantum logics, and logics of constructive mathematics.
- 1 December 2011
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 76 (4) , 1261-1286
Quasi-subtractive varieties
Varieties like groups, rings, or Boolean algebras have the property that, in any of their members, the lattice of congruences is isomorphic to a lattice of more manageable objects, for example normal subgroups of groups, two-sided ideals of rings, filters (or ideals) of Boolean algebras. Abstract algebraic logic can explain these phenomena at a rather satisfactory level of generality: in every memberAof aτ-regular varietythe lattice of congruences ofAis isomorphic to the lattice of deductive filters onAof theτ-assertional logic of. Moreover, ifhas a constant 1 in its type and is 1-subtractive, the deductive filters onA∈of the 1-assertional logic ofcoincide with the-ideals ofAin the sense of Gumm and Ursini, for which we have a manageable concept of ideal generation.However, there are isomorphism theorems, for example, in the theories of residuated lattices, pseudointerior algebras and quasi-MV algebras that cannot be subsumed by these general results. The aim of the present paper is to appropriately generalise the concepts of subtractivity andτ-regularity in such a way as to shed some light on the deep reason behind such theorems. The tools and concepts we develop hereby provide a common umbrella for the algebraic investigation of several families of logics, including substructural logics, modal logics, quantum logics, and logics of constructive mathematics.
- 12 February 2011
- Published by Springer Nature in Algebra universalis
- Vol. 65 (1) , 1-7
Principal congruences on pseudocomplemented semilattices
- 12 February 2011
- Published by Springer Nature in Algebra universalis
- Vol. 65 (1) , 1-7
Principal congruences on pseudocomplemented semilattices
- 1 December 2010
- Published by Springer Nature in Algebra universalis
- Vol. 64 (3-4) , 397-402
Lee classes for pseudocomplemented semilattices, revisited
- 1 December 2010
- Published by Springer Nature in Algebra universalis
- Vol. 64 (3-4) , 397-402
Lee classes for pseudocomplemented semilattices, revisited
- 3 February 2010
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 20 (2) , 619-643
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalizations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define several interesting logics from these structures, so far this aspect has not been investigated. The present article aims at filling this gap.
- 3 February 2010
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 20 (2) , 619-643
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalizations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define several interesting logics from these structures, so far this aspect has not been investigated. The present article aims at filling this gap.