scientific article; zbMATH DE number 1418370

MaRDI QIDQ4941933zbMATH OpenFDO

Authors Beata Konikowska

Publication date 6 December 2000

zbMATH Keywords

completenessindiscernibilitynatural deductionnondeterminismRasiowa-Sikorski deduction systemssimilaritythree-valued logics

Mathematics Subject Classification ID

Classical first-order logic (03B10) Abstract deductive systems (03B22) Many-valued logic (03B50) Logic in computer science (03B70)

Recommendations

• Rasiowa-Sikorski deduction systems in computer science applications.
• Rasiowa-Sikorski deduction systems with the rule of cut: a case study
• scientific article; zbMATH DE number 1343458
• scientific article; zbMATH DE number 44853
• Proof theory and automated deduction

Cited in

(5)

• The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G.
• Rasiowa-Sikorski deduction systems in computer science applications.
• Quantifier-free logic for nondeterministic theories
• Rasiowa-Sikorski deduction systems with the rule of cut: a case study
• Quantifier-free logic for multialgebraic theories

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941933)