Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Undecidability of a weak version of MSO+U

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2020
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030187559059463
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5755
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2020
publishDateSort 2020
record_format rss_article
spellingShingle Undecidability of a weak version of MSO+U
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Undecidability of a weak version of MSO+U
title_auth Undecidability of a weak version of MSO+U
title_full Undecidability of a weak version of MSO+U
title_fullStr Undecidability of a weak version of MSO+U
title_full_unstemmed Undecidability of a weak version of MSO+U
title_short Undecidability of a weak version of MSO+U
title_sort undecidability of a weak version of mso+u
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.23638/LMCS-16(1:12)2020