Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

Undecidable theories in stationary logic


Authors: Detlef Seese, Peter Tuschik and Martin Weese
Journal: Proc. Amer. Math. Soc. 84 (1982), 563-567
MSC: Primary 03C80; Secondary 03D35
MathSciNet review: 643750
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: It is shown that the theories of the following classes become undecidable in stationary logic: Well orderings with one unary predicate, linear orderings, and Boolean algebras. This is done by interpreting the theory of symmetric reflexive graphs.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03C80, 03D35

Retrieve articles in all journals with MSC: 03C80, 03D35


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1982-0643750-3
PII: S 0002-9939(1982)0643750-3
Keywords: Stationary logic, undecidability, linear ordering, Boolean algebra
Article copyright: © Copyright 1982 American Mathematical Society