scientific article; zbMATH DE number 7533347

DOI10.4230/LIPIcs.CSL.2018.22MaRDI QIDQ5079746

Jonni Virtema, Jan Van den Bussche, Flavio Ferrarotti

Publication date: 28 May 2022

Full work available at URL: https://arxiv.org/abs/1804.05926

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

zbMATH Keywords

expressive powerdescriptive complexityhigher-order logics

Mathematics Subject Classification ID

Logic in computer science (03B70)

Uses Software

• Rodin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choiceless polynomial time
• An existential fragment of second order logic
• Shortening QBF proofs with dependency schemes
• Dependency learning for QBF
• On fragments of higher order logics that on finite structures collapse to second order
• Computer science logic. 18th international workshop, CSL 2004, 13th annual conference of the EACSL, Karpacz, Poland, September 20--24, 2004. Proceedings.
• Domino-tiling games
• The monadic second-order logic of graphs. VIII: Orientations
• Abstract state machines and computationally complete query languages
• Solution validation and extraction for QBF preprocessing
• Graph Coloring and the Immersion Order
• On static logics, dynamic logics, and complexity classes
• Languages that Capture Complexity Classes
• Nondeterministic Space is Closed under Complementation
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Abstract State Machines
• Expressing properties in second- and third-order logic: hypercube graphs and SATQBF
• Computer Science Logic
• Finding topological subgraphs is fixed-parameter tractable
• On Context-Free Languages
• Regular Queries on Graph Databases.