<div class="csl-bib-body">
<div class="csl-entry">Pflug, F. (2014). <i>On the expressibility of semi-unification problems : decidability and undecidability results</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.26623</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2014.26623
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/8403
-
dc.description
Abweichender Titel laut Übersetzung der Verfasserin/des Verfassers
-
dc.description
Zsfassung in dt. Sprache
-
dc.description.abstract
The Semi-Unification Problem is a generalization of the well known Unification Problem. This thesis provides a modified version of the original undecidability result. The argument is focused on path equationes. This is the first transparent proof known.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
Unification
en
dc.subject
Semi-Unification
en
dc.title
On the expressibility of semi-unification problems : decidability and undecidability results
en
dc.title.alternative
Die Expressibiltät von Semi-Unificationsproblemen
de
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2014.26623
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Florian Pflug
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
tuw.publication.orgunit
E104 - Institut für Diskrete Mathematik und Geometrie