Pages that link to "Item:Q5625141"
From MaRDI portal
The following pages link to Decidability of Second-Order Theories and Automata on Infinite Trees (Q5625141):
Displaying 50 items.
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- SnS can be modally characterized (Q914397) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Strategy logic (Q979080) (← links)
- Logic and rational languages of words indexed by linear orderings (Q987379) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- From liveness to promptness (Q1039845) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- Graded modalities. I (Q1065786) (← links)
- Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (Q1068544) (← links)
- Decidability of extended theories of addition of the natural numbers and the integers (Q1071748) (← links)
- Variétés d'automates descendants d'arbres infinis (Q1079382) (← links)
- Construction of decidable singular theories of two successor functions with an extra predicate (Q1079557) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- The greatest fixed-points and rational omega-tree languages (Q1082091) (← links)
- Elementary and algebraic properties of the Arens-Kaplansky constructions (Q1082333) (← links)
- The theory of ends, pushdown automata, and second-order logic (Q1084096) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- Decidable unary varieties (Q1085191) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- Topological characterizations of infinite tree languages (Q1092675) (← links)
- Undecidability of theories of Boolean algebras with selected ideals (Q1092889) (← links)
- The word problem for \(Heyting^ *\) algebras (Q1095167) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Countably-categorical Boolean algebras with distinguished ideals (Q1104315) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- On alternating \(\omega\)-automata (Q1109572) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- Finitely axiomatizable Boolean algebras with distinguished ideals (Q1112807) (← links)
- Logical definability of fixed points (Q1114673) (← links)
- Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
- Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties (Q1119619) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- On translations of temporal logic of actions into monadic second-order logic (Q1127537) (← links)
- Prevarieties of associative rings whose elementary theory is decidable (Q1136753) (← links)
- Monadic theory of order and topology. II (Q1137035) (← links)
- The first order theory of Boolean algebras with a distinguished group of automorphisms (Q1154492) (← links)
- Decidability for branching time (Q1155599) (← links)
- Petri nets and regular languages (Q1158763) (← links)
- On direct products of automaton decidable theories (Q1168306) (← links)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- Constructivizations of Boolean algebras (Q1171567) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
