scientific article; zbMATH DE number 3880651
From MaRDI portal
Publication:3346281
Recommendations
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
- Model Transformations in Decidability Proofs for Monadic Theories
- The monadic theory of morphic infinite words and generalizations
- scientific article; zbMATH DE number 4016858
Cited in
(34)- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Monadic second-order logic on tree-like structures
- On infinite transition graphs having a decidable monadic theory
- Shelah-Stupp's and Muchnik's iterations revisited
- Rabin's theorem in the concurrency setting: a conjecture
- On decidability of list structures
- On Boolean closed full trios and rational Kripke frames
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Iterated pushdown automata and sequences of rational numbers
- Truthful Monadic Abstractions
- scientific article; zbMATH DE number 6387492 (Why is no real title available?)
- scientific article; zbMATH DE number 4016858 (Why is no real title available?)
- Asymptotic subword complexity
- Simple monadic theories and partition width
- The mu-calculus and Model Checking
- It is decidable whether a monadic thue system is canonical over a regular set
- DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- Model Transformations in Decidability Proofs for Monadic Theories
- On monadic theories of monadic predicates
- SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
- A MONADIC APPROACH TO THE MODAL THEORY
- scientific article; zbMATH DE number 175645 (Why is no real title available?)
- Infinite and bi-infinite words with decidable monadic theories
- Monadic theories of wellorders
- Decidability in Intuitionistic Type Theory is Functionally Decidable
- A list of arithmetical structures complete with respect to the first-order definability
- Choice functions and well-orderings over the infinite binary tree
- Exact complexity bounds for ordinal addition
- Automatic structures and the problem of natural well-orderings
- On the expansion of monadic second-order logic with Cantor-Bendixson rank and order type predicates
- Regular sets over extended tree structures
- Nonmaximal decidable structures
- On the structure of graphs in the Caucal hierarchy
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346281)