Minimizing disjunctive normal forms of pure first-order logic

DOI10.1093/JIGPAL/JZX003MaRDI QIDQ4644489zbMATH OpenOpenAlexFDO

Authors Timm Lampert

Publication date 8 January 2019

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzx003

zbMATH Keywords

disjunctive normal formsfirst-order logicoptimizationpurificationQuine-McCluskey algorithm

Mathematics Subject Classification ID

Classical first-order logic (03B10)

Recommendations

• An algorithm for dual transformation in first-order logic
• scientific article; zbMATH DE number 4089620
• Normal forms of fuzzy formulas and their minimization
• Minimization of disjunctive normal forms of fuzzy logic functions
• About the one question of implementation of the logic of sentences

Cited in

(9)

• Deciding simple infinity axiom sets with one binary relation by means of superpostulates
• A note on the size of prenex normal forms
• Minimizing Disjunctive Normal Form Formulas and AC^0 Circuits Given a Truth Table
• scientific article; zbMATH DE number 4043810 (Why is no real title available?)
• scientific article; zbMATH DE number 4079375 (Why is no real title available?)
• Wittgenstein's \(ab\)-notation: an iconic proof procedure
• Iconic Logic and Ideal Diagrams: The Wittgensteinian Approach
• Hintikka's conception of syntheticity as the introduction of new individuals
• Synthetic proofs

This page was built for publication: Minimizing disjunctive normal forms of pure first-order logic

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