Publication:3586024: Difference between revisions
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 03:06, 5 February 2024
DOI10.1007/978-3-642-15025-8_30zbMATH Open1287.03029OpenAlexW1510368107MaRDI QIDQ3586024FDOQ3586024
Publication date: 3 September 2010
Published in: Fields of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_30
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The monadic theory of morphic infinite words and generalizations
- Rabin's uniformization problem
- MSO on the Infinite Binary Tree: Choice and Order
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Automata, logics, and infinite games. A guide to current research
- Testing and generating infinite sequences by a finite automaton
- Modest theory of short chains. I
- The monadic theory of order
- Decidability and undecidability of theories with a predicate for the primes
- Definability in the monadic second-order theory of successor
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Choice functions and well-orderings over the infinite binary tree
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- Modest theory of short chains. II
- The Monadic Theory of Tree-like Structures
- The theory of successor with an extra predicate
- On the bounded monadic theory of well-ordered structures
Cited In (10)
- Truthful Monadic Abstractions
- Monadic translation of classical sequent calculus
- Monotone recursive definition of predicates and its realizability interpretation
- A MONADIC APPROACH TO THE MODAL THEORY
- Synthesizing Monadic Predicates
- Title not available (Why is that?)
- On Monadic Second-Order Theories of Multidominance Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Undecidable first-order theories of affine geometries
This page was built for publication: On Monadic Theories of Monadic Predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586024)