Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis (Q5215504)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7166056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis |
scientific article; zbMATH DE number 7166056 |
Statements
Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis (English)
0 references
11 February 2020
0 references
proof search
0 references
correspondence analysis
0 references
three-valued logic
0 references
strong Kleene logic
0 references
natural deduction
0 references
proof theory
0 references
0 references
0 references
0 references
0.8289747834205627
0 references
0.8225085139274597
0 references
0.7881451845169067
0 references
