On the expressive power of monadic least fixed point logic (Q817849): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1560572178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The closure of monadic NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal mu-calculus alternation hierarchy is strict / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted second order logic for finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonerasing, counting, and majority over the linear time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query evaluation via tree-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog and the expressive power of languages for Web information extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance properties of RAMs and linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms and NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, linear time and the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic logical definability of nondeterministic linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing the succinctness of monadic query languages over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality of order-invariant first-order formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes and theories of finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantifier structure of sentences that characterize nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic quantifier alternation hierarchy over grids and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudimentary Languages and Second‐Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic, first-order logic, and counting quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:08, 24 June 2024

scientific article
Language Label Description Also known as
English
On the expressive power of monadic least fixed point logic
scientific article

    Statements

    On the expressive power of monadic least fixed point logic (English)
    0 references
    0 references
    20 March 2006
    0 references
    finite model theory
    0 references
    descriptive complexity theory
    0 references
    fixed point logic
    0 references
    monadic second-order logic
    0 references
    linear time complexity classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers