The completeness of a predicate-functor logic (Q3714045)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The completeness of a predicate-functor logic |
scientific article; zbMATH DE number 3941495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The completeness of a predicate-functor logic |
scientific article; zbMATH DE number 3941495 |
Statements
The completeness of a predicate-functor logic (English)
0 references
1985
0 references
axiomatization
0 references
semantic completeness
0 references
natural deduction
0 references
first-order logic without individual symbols
0 references
Henkin model
0 references
multiple maximal consistent sets
0 references
Traditional Formal Logic
0 references
0.7923761606216431
0 references
0.7362924814224243
0 references
