Expressivity within second-order transitive-closure logic
From MaRDI portal
Publication:5079746
DOI10.4230/LIPICS.CSL.2018.22MaRDI QIDQ5079746FDOQ5079746
Authors: Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema 
Publication date: 28 May 2022
Full work available at URL: https://arxiv.org/abs/1804.05926
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dependency learning for QBF
- Abstract State Machines
- On Context-Free Languages
- Nondeterministic Space is Closed under Complementation
- Modeling in Event B. System and software engineering.
- Title not available (Why is that?)
- Languages that Capture Complexity Classes
- Title not available (Why is that?)
- The monadic second-order logic of graphs. VIII: Orientations
- Graph coloring and the immersion order
- Finding topological subgraphs is fixed-parameter tractable
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Domino-tiling games
- Choiceless polynomial time
- Abstract state machines and computationally complete query languages
- On static logics, dynamic logics, and complexity classes
- An existential fragment of second order logic
- On fragments of higher order logics that on finite structures collapse to second order
- Shortening QBF proofs with dependency schemes
- Computer science logic. 18th international workshop, CSL 2004, 13th annual conference of the EACSL, Karpacz, Poland, September 20--24, 2004. Proceedings.
- Solution validation and extraction for QBF preprocessing
- Regular queries on graph databases
- Computer Science Logic
- Expressing properties in second- and third-order logic: hypercube graphs and SATQBF
Cited In (1)
Uses Software
This page was built for publication: Expressivity within second-order transitive-closure logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079746)
