Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Decidability of monadic theories

Decidability of monadic theories

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 176/1984
BookMathematical Foundations of Computer Science 1984
DOI10.1007/BFb0030285
Copyright1984
ISBN978-3-540-13372-8
CategoryInvited Lectures
DOI10.1007/BFb0030296
Pages162-175
Subject CollectionComputer Science
SpringerLink DateTuesday, April 11, 2006
Add to marked items

Invited Lectures

Decidability of monadic theories

A. L. Semenov1

(1)  Academy of Sciences, Moscow
Without Abstract
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Referenced by
2 newer articles

  1. Bès, A. (2009) Nonmaximal decidable structures. Journal of Mathematical Sciences
    [CrossRef]
  2. Khoussainov, Bakhadyr (1998) Games with Unknown Past. Mathematical Logic Quarterly 44(2)
    [CrossRef]
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.110 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)