Constructing denumerable matrices strongly adequate for pre-finite logics (Q1219875): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A propositional calculus with denumerable matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5619070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A series of successive modifications of Peirce's rule / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734410 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5518356 / rank | |||
Normal rank |
Latest revision as of 16:14, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing denumerable matrices strongly adequate for pre-finite logics |
scientific article |
Statements
Constructing denumerable matrices strongly adequate for pre-finite logics (English)
0 references
1975
0 references