The completeness of a predicate-functor logic
type: Item
instance of: scholarly article
title: The completeness of a predicate-functor logic
zbMATH Open document ID: 0587.03003
DOI: 10.2307/2273980
author: John Bacon
published in: Journal of Symbolic Logic
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 3941495
zbMATH Keywords: axiomatization
zbMATH Keywords: semantic completeness
zbMATH Keywords: natural deduction
zbMATH Keywords: first-order logic without individual symbols
zbMATH Keywords: Henkin model
zbMATH Keywords: multiple maximal consistent sets
zbMATH Keywords: Traditional Formal Logic
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.2307/2273980
OpenAlex ID: W2006712173
cites work: Predicate-functors and the limits of decidability in logic
cites work: An axiomatization of predicate functor logic
cites work: Quantifiers as modal operators
cites work: Logical inference in English: A preliminary analysis
cites work: Q3241233
cites work: Completeness Theorems for the Systems E of Entailment and EQ of Entailment with Quantification
Recommended article: A tableau system of proof for predicate-functor logic with identity
Recommended article: Q3765741
Recommended article: Q4329237
Recommended article: Q3466613
Recommended article: Q4943268
description: scientific article