Skip to main content Accessibility help
×
Home
Hostname: page-component-7f7b94f6bd-dwjtz Total loading time: 0.234 Render date: 2022-06-29T10:55:13.157Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

The decision problem for branching time logic1,2

Published online by Cambridge University Press:  12 March 2014

Yuri Gurevich
Affiliation:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109
Saharon Shelah
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem 91904, Israel

Abstract

The theory of trees with additional unary predicates and quantification over nodes and branches embraces a rich branching time logic. This theory was reduced in the companion paper to the first-order theory of binary, bounded, well-founded trees with additional unary predicates. Here we prove the decidability of the latter theory.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

The results were obtained in principle during the Jerusalem Logic Year 1980–81 when both authors were fellows in the Institute for Advanced Studies of Hebrew University.

2

Supported in part by the US-Israel Binational Science Foundation.

References

[DMT]Doner, J. E., Mostowski, A. and Tarski, A., The elementary theory of well-ordering-a metamathematical study, Logic Colloquium '77, North-Holland, Amsterdam, 1978, pp. 154.Google Scholar
[Eh]Ehrenfeucht, A., An application of games to the completeness problem for formalized theories, Fundamenta Mathematicae, vol. 49(1961), pp. 129141:CrossRefGoogle Scholar
[Gu]Gurevich, Y., Monadic second-order theories, Model-theoretical logics (Barwise, J. and Feferman, S., editors), Springer-Verlag, Berlin (to appear).Google Scholar
[Gu2]Gurevich, Y., Toward logic tailored for computational complexity, Logic Colloquium '83, Lecture Notes in Mathematics, Springer-Verlag, Berlin (to appear).Google Scholar
[GS]Gurevich, Y. and Shelah, S., To the decision problem for branching time logic, Foundations of logic and linguistics: Problems and their solutions, Plenum Press (to appear).Google Scholar
[Sh]Shelah, S., The monadic theory of order, Annals of Mathematics, ser. 2, vol. 102 (1975), pp. 379419.CrossRefGoogle Scholar
36
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The decision problem for branching time logic1,2
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

The decision problem for branching time logic1,2
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

The decision problem for branching time logic1,2
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *