default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Spinks
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Thiago Nascimento
, Umberto Rivieccio, João Marcos, Matthew Spinks:
Nelson's logic ℒ. Log. J. IGPL 28(6): 1182-1206 (2020)
2010 – 2019
- 2019
- [j11]Robert J. Bignall, Matthew Spinks:
Dual binary discriminator varieties. Art Discret. Appl. Math. 2(2) (2019) - [j10]Matthew Spinks, Umberto Rivieccio, Thiago Nascimento:
Compatibly involutive residuated lattices and the Nelson identity. Soft Comput. 23(7): 2297-2320 (2019) - 2018
- [c6]Thiago Nascimento, Umberto Rivieccio, João Marcos, Matthew Spinks:
Algebraic Semantics for Nelson's Logic S S. WoLLIC 2018: 271-288 - [c5]Umberto Rivieccio, Matthew Spinks:
Quasi-Nelson Algebras. LSFA 2018: 169-188 - 2014
- [j9]Francesco Paoli, Antonio Ledda, Tomasz Kowalski, Matthew Spinks:
Quasi-discriminator varieties. Int. J. Algebra Comput. 24(3): 375- (2014) - 2013
- [j8]Karin Cvetko-Vah, Jonathan Leech, Matthew Spinks:
Skew lattices and binary operations on functions. J. Appl. Log. 11(3): 253-265 (2013) - 2011
- [j7]Tomasz Kowalski, Francesco Paoli, Matthew Spinks:
Quasi-subtractive varieties. J. Symb. Log. 76(4): 1261-1286 (2011) - [j6]Karin Cvetko-Vah, Michael K. Kinyon, Jonathan Leech, Matthew Spinks:
Cancellation in Skew Lattices. Order 28(1): 9-32 (2011) - 2010
- [j5]Félix Bou, Francesco Paoli, Antonio Ledda, Matthew Spinks, Roberto Giuntini:
The Logic of Quasi-MV Algebras. J. Log. Comput. 20(2): 619-643 (2010)
2000 – 2009
- 2008
- [j4]Francesco Paoli, Matthew Spinks, Robert Veroff:
Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties. Logica Universalis 2(2): 209-233 (2008) - [j3]Matthew Spinks, Robert Veroff:
Constructive Logic with Strong Negation is a Substructural Logic. I. Stud Logica 88(3): 325-348 (2008) - [j2]Matthew Spinks, Robert Veroff:
Constructive Logic with Strong Negation is a Substructural Logic. II. Stud Logica 89(3): 401-425 (2008) - 2006
- [j1]Robert Veroff, Matthew Spinks:
Axiomatizing the Skew Boolean Propositional Calculus. J. Autom. Reason. 37(1-2): 3-20 (2006)
1990 – 1999
- 1998
- [c4]Robert J. Bignall, Matthew Spinks:
Multiple-Valued Logics for Theorem-Proving in First Order Logic with Equality. ISMVL 1998: 102-107 - 1997
- [c3]Robert J. Bignall, Matthew Spinks:
Multiple-Valued Logic as a Programming Language. ISMVL 1997: 227-232 - 1996
- [c2]Robert J. Bignall, Matthew Spinks:
Propositional Skew Boolean Logic. ISMVL 1996: 43-49 - [c1]Matthew Spinks, Jack Wood:
Office-based telecommuting: an international comparison of satellite offices in Japan & North America. SIGCPR 1996: 338-350
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
