Strong Completeness of a Pure Free Logic

DOI10.1002/MALQ.19850310104MaRDI QIDQ3682469zbMATH OpenOpenAlexFDO

Authors Ermanno Bencivenga

Publication date 1985

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19850310104

zbMATH Keywords

deductive consequencesfree quantification theorysemantic consequences

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35)

Recommendations

• Strong completeness of lattice-valued logic
• Strong conceptual completeness for first-order logic
• scientific article; zbMATH DE number 1169382
• Strong completeness of coalgebraic modal logics
• On the strong semantical completeness of the intuitionistic predicate calculus
• A theory of strict P-completeness
• A theory of strict P-completeness
• Strongly complete logics for coalgebras
• Strict Fregean free logic
• On the strong completion of logic programs

Cited in

(6)

• A theory of strict P-completeness
• Truth-value semantics for a logic of existence
• Semantic Completeness of Free-Variable Theories
• PURE LOGIC OF ITERATED FULL GROUND
• Programming Languages and Systems
• A fundamental completeness theorem for bivalent free logics

This page was built for publication: Strong Completeness of a Pure Free Logic

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