How to prove decidability of equational theories with second-order computation analyser SOL.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jfp/Hamana19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jfp/Hamana19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Makoto_Hamana
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1017%2FS0956796819000157
>
foaf:
homepage
<
https://doi.org/10.1017/S0956796819000157
>
dc:
identifier
DBLP journals/jfp/Hamana19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1017%2FS0956796819000157
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jfp
>
rdfs:
label
How to prove decidability of equational theories with second-order computation analyser SOL.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Makoto_Hamana
>
swrc:
pages
e20
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jfp/Hamana19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jfp/Hamana19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jfp/jfp29.html#Hamana19
>
rdfs:
seeAlso
<
https://doi.org/10.1017/S0956796819000157
>
dc:
title
How to prove decidability of equational theories with second-order computation analyser SOL.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
29
(xsd:string)