Propositional Logic for Circuit Classes

DOI10.1007/978-3-540-74915-8_38zbMATH Open1179.03035OpenAlexW1494384533MaRDI QIDQ3608435FDOQ3608435

Authors: Klaus Aehlig, Arnold Beckmann 

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_38

Recommendations

• scientific article; zbMATH DE number 1390276
• scientific article; zbMATH DE number 7204319
• A logic for constant-depth circuits
• Computer Science Logic
• The Complexity of Propositional Proofs

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in computer science (03B70) Complexity of proofs (03F20)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Propositional Logic for Circuit Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608435)