scientific article; zbMATH DE number 1302020

zbMath0945.03546MaRDI QIDQ4247261

No author found.

Publication date: 7 December 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (23)

Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits ⋮ Parameterized Complexity Classes under Logical Reductions ⋮ Generic incremental algorithms for local search ⋮ An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers ⋮ SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy ⋮ Capturing the polynomial hierarchy by second-order revised Krom logic ⋮ COMPLEXITY, INFORMATION, ENERGY ⋮ Characterizing polynomial Ramsey quantifiers ⋮ Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications ⋮ Epsilon-logic is more expressive than first-order logic over finite structures ⋮ Number of variables is equivalent to space ⋮ Annotation theories over finite graphs ⋮ DESCRIPTIVE COMPLEXITY OF FINITE ABELIAN GROUPS ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ Hardness of equivalence checking for composed finite-state systems ⋮ $$P\mathop{ =}\limits^{?}NP$$ ⋮ A Logical Characterization of Small 2NFAs ⋮ Approximate databases: a support tool for approximate reasoning ⋮ Knowledge representation analysis of graph mining ⋮ Voting by eliminating quantifiers ⋮ The probability nesting game ⋮ An infinite hierarchy of temporal logics over branching time ⋮ On the space and circuit complexity of parameterized problems: classes and completeness

This page was built for publication: