First-order logics: some characterizations and closure properties (Q715044): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s00236-012-0157-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975359072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting quantifiers, successor relations, and logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Algol-Like Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on semilinear sets and bounded-reversal multihead pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some subclasses of context-free languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressibility and Parallel Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The descriptive complexity approach to LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative complexity of some languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape-bounded complexity classes and multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 18:05, 5 July 2024

scientific article
Language Label Description Also known as
English
First-order logics: some characterizations and closure properties
scientific article

    Statements

    First-order logics: some characterizations and closure properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2012
    0 references
    \(\mathrm{FO}[+]\)-definable languages
    0 references
    recognition
    0 references
    word bounded languages
    0 references
    semilinear languages
    0 references

    Identifiers