Monadic Second-Order Logic with Arbitrary Monadic Predicates
Abstract
References
Index Terms
- Monadic Second-Order Logic with Arbitrary Monadic Predicates
Recommendations
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Buchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates (sets) can be added to (Nat, <) while preserving decidability__ __ Elgot and ...
On Monadic theories of monadic predicates
Fields of logic and computationPioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic second-order logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the successor structure ...
Axiomatizations and computability of weighted monadic second-order logic
LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer ScienceWeighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted formulas ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- Alan Turing Institute under the EPSRC
- French Agence Nationale de la Recherche, AGGREG project
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 89Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in