The undecidability of the first-order theories of one step rewriting in linear 
canonical systems

Vorobyov, Sergei

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The undecidability of the first-order theories of one step rewriting in linear canonical systems

MPS-Authors

/persons/resource/persons45677

Vorobyov, Sergei
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Vorobyov, S. (2002). The undecidability of the first-order theories of one step rewriting in linear canonical systems. Information and Computation, 175, 182-213.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-30A6-F

Abstract

There is no abstract available