scientific article; zbMATH DE number 3510287

MaRDI QIDQ4090322zbMATH OpenFDO

Authors Albert R. Meyer

Publication date 1975

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Cited in

(26)

• Process logic: Expressiveness, decidability, completeness
• Decision procedures for inductive Boolean functions based on alternating automata
• Nested antichains for WS1S
• Complexity results for classes of quantificational formulas
• Ehrenfeucht games and ordinal addition
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A Practical Approach to Courcelle's Theorem
• A link between multioperator and tree valuation automata and logics
• Automata-theoretic techniques for modal logics of programs
• Inverse monoids: decidability and complexity of algebraic questions.
• The complementation problem for Büchi automata with applications to temporal logic
• A logic of reachable patterns in linked data-structures
• Exact complexity bounds for ordinal addition
• On decidability properties of local sentences
• Logic, semigroups and automata on words
• wMSO theories as grammar formalisms
• Lazy automata techniques for WS1S
• Logical aspects of Cayley-graphs: the group case
• An improved lower bound for the elementary theories of trees
• Mathematical modal logic: A view of its evolution
• Decidability of the Clark's completion semantics for monadic programs and queries
• Bounded-width QBF is PSPACE-complete
• The complexity of the temporal logic with ``until over general linear time
• scientific article; zbMATH DE number 7407776 (Why is no real title available?)
• The most nonelementary theory
• From Monadic Logic to PSL

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 Q4090322)