On the degree of complexity of sentential logics. A couple of examples (Q1163542): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Constructing denumerable matrices strongly adequate for pre-finite logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3909027 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4124817 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3268305 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deducibility and many-valuedness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The existence of matrices strongly adequate for E, R and their fragments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on the consequence operation in sentential logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4109644 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of a conjecture of Roman Suszko / rank | |||
Normal rank |
Latest revision as of 15:34, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the degree of complexity of sentential logics. A couple of examples |
scientific article |
Statements
On the degree of complexity of sentential logics. A couple of examples (English)
0 references
1981
0 references
adequacy problem
0 references
matrix semantics
0 references
minimal logic
0 references
deducibility
0 references