The completeness of a predicate-functor logic

DOI10.2307/2273980zbMath0587.03003OpenAlexW2006712173MaRDI QIDQ3714045

John Bacon

Publication date: 1985

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273980

zbMATH Keywords

natural deductionaxiomatizationsemantic completenessHenkin modelfirst-order logic without individual symbolsmultiple maximal consistent setsTraditional Formal Logic

Mathematics Subject Classification ID

Classical first-order logic (03B10)

Related Items (2)

Algebraization of quantifier logics, an introductory overview ⋮ Freeing Structural Realism from Model Theory

Cites Work

• Predicate-functors and the limits of decidability in logic
• Logical inference in English: A preliminary analysis
• Quantifiers as modal operators
• An axiomatization of predicate functor logic
• Completeness Theorems for the Systems E of Entailment and EQ of Entailment with Quantification
• Unnamed Item

This page was built for publication: The completeness of a predicate-functor logic