Minimizing disjunctive normal forms of pure first-order logic

DOI10.1093/JIGPAL/JZX003zbMATH Open1405.03023OpenAlexW2604868491MaRDI QIDQ4644489FDOQ4644489

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

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

zbMATH Keywords

optimizationfirst-order logicdisjunctive normal formspurificationQuine-McCluskey algorithm

Mathematics Subject Classification ID

Classical first-order logic (03B10)

Cited In (7)

• A note on the size of prenex normal forms
• Iconic Logic and Ideal Diagrams: The Wittgensteinian Approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Wittgenstein's \(ab\)-notation: an iconic proof procedure
• Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
• Deciding simple infinity axiom sets with one binary relation by means of superpostulates

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)