A note on the size of prenex normal forms

DOI10.1016/j.ipl.2016.03.005zbMath1356.03047OpenAlexW2296632414MaRDI QIDQ269710

Frederik Harwath

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.03.005

zbMATH Keywords

algorithmsformal methodsformula size and succinctnesslogic in computer science

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Related Items (1)

Feferman-vaught decompositions for prefix classes of first order logic

Cites Work

• Boolean function complexity. Advances and frontiers.
• Size-depth tradeoffs for Boolean formulae
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the size of prenex normal forms