The following pages link to (Q4982110):
Displaying 22 items.
- Correspondence analysis for some fragments of classical propositional logic (Q828774) (← links)
- Generalized correspondence analysis for three-valued logics (Q1632053) (← links)
- The natural deduction systems for the three-valued nonsense logics Z and E (Q1647261) (← links)
- Natural deduction for Post's logics and their duals (Q1653550) (← links)
- Natural deduction for Fitting's four-valued generalizations of Kleene's logics (Q1689568) (← links)
- A class of implicative expansions of Kleene's strong logic, a subclass of which is shown functionally complete via the precompleteness of Łukasiewicz's 3-valued logic Ł3 (Q2236505) (← links)
- Natural deduction system for three-valued Heyting's logic (Q2403575) (← links)
- Correspondence analysis and automated proof-searching for first degree entailment (Q2663794) (← links)
- Two-sided sequent calculi for \textit{FDE}-like four-valued logics (Q2698547) (← links)
- AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX (Q4600826) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Natural deduction for three-valued regular logics (Q4683206) (← links)
- Natural Deduction for Four-Valued both Regular and Monotonic Logics (Q4683216) (← links)
- (Q4997922) (← links)
- (Q4997950) (← links)
- (Q4999723) (← links)
- Normalisation for Some Quite Interesting Many-Valued Logics (Q5013635) (← links)
- Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation (Q5156187) (← links)
- Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis (Q5215504) (← links)
- Functional Completeness in CPL via Correspondence Analysis (Q5241402) (← links)
- The Method of Socratic Proofs Meets Correspondence Analysis (Q5241406) (← links)
- Non-transitive correspondence analysis (Q6156626) (← links)
