Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Matthew Spinks is active.

Publication


Featured researches published by Matthew Spinks.


Studia Logica | 2008

Constructive Logic with Strong Negation is a Substructural Logic. I

Matthew Spinks; Robert Veroff

The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFLew of the substructural logic FLew. In this paper, it is shown that the equivalent variety semantics of N (namely, the variety of Nelson algebras) and the equivalent variety semantics of NFLew (namely, a certain variety of FLew-algebras) are term equivalent. This answers a longstanding question of Nelson [30]. Extensive use is made of the automated theorem-prover Prover9 in order to establish the result.The main result of this paper is exploited in Part II of this series [40] to show that the deductive systems N and NFLew are definitionally equivalent, and hence that constructive logic with strong negation is a substructural logic over FLew.


Order | 2011

Cancellation in Skew Lattices

Karin Cvetko-Vah; Michael K. Kinyon; Jonathan Leech; Matthew Spinks

Distributive lattices are well known to be precisely those lattices that possess cancellation:


Journal of Logic and Computation | 2010

The Logic of Quasi-MV Algebras

Félix Bou; Francesco Paoli; Antonio Ledda; Matthew Spinks; Roberto Giuntini

x \lor y = x \lor z


Journal of Automated Reasoning | 2006

Axiomatizing the Skew Boolean Propositional Calculus

Robert Veroff; Matthew Spinks

and


Logica Universalis | 2008

Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties

Francesco Paoli; Matthew Spinks; Robert Veroff

x \land y = x \land z


Journal of Applied Logic | 2013

Skew lattices and binary operations on functions

Karin Cvetko-Vah; Jonathan Leech; Matthew Spinks

imply y = z. Cancellation, in turn, occurs whenever a lattice has neither of the five-element lattices M3 or N5 as sublattices. In this paper we examine cancellation in skew lattices, where the involved objects are in many ways lattice-like, but the operations


International Journal of Algebra and Computation | 2014

Quasi-discriminator varieties

Francesco Paoli; Antonio Ledda; Tomasz Kowalski; Matthew Spinks

\land


Archive | 2018

Paraconsistent constructive logic with strong negation as a contraction-free relevant logic

Matthew Spinks; Robert Veroff

and


international symposium on multiple-valued logic | 1997

Multiple-valued logic as a programming language

Robert J. Bignall; Matthew Spinks

\lor


workshop on logic language information and computation | 2018

Algebraic Semantics for Nelson’s Logic \(\mathcal {S}\)

Thiago Nascimento; Umberto Rivieccio; João Marcos; Matthew Spinks

no longer need be commutative. In particular, we find necessary and sufficient conditions involving the nonoccurrence of potential sub-objects similar to M3 or N5 that ensure that a skew lattice is left cancellative (satisfying the above implication) right cancellative (

Collaboration


Dive into the Matthew Spinks's collaboration.

Top Co-Authors

Avatar

Robert Veroff

University of New Mexico

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

João Marcos

Federal University of Rio Grande do Norte

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge