scientific article; zbMATH DE number 4210101

zbMATH Open0732.03007MaRDI QIDQ3358705FDOQ3358705

Authors: Wojciech Suchon 

Publication date: 1991

Title of this publication is not available (Why is that?)

Recommendations

• Counting proofs in propositional logic
• Independence of countable sets of formulas of the propositional logic.
• Publication:3477944
• The number of Boolean functions computed by formulas of a given size
• Counting propositional models

zbMATH Keywords

counting functionspropositional calculusBASIC

Mathematics Subject Classification ID

Classical propositional logic (03B05) Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Cited In (4)

• Counting proofs in propositional logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• From arithmetic expressions to propositional formulae

This page was built for publication:

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