Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 6418709 - MaRDI portal

scientific article; zbMATH DE number 6418709

From MaRDI portal
Publication:4982110

zbMath1308.03041MaRDI QIDQ4982110

Allard M. Tamminga

Publication date: 23 March 2015


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (22)

Correspondence analysis for some fragments of classical propositional logicGeneralized correspondence analysis for three-valued logicsThe natural deduction systems for the three-valued nonsense logics Z and ENatural deduction for Post's logics and their dualsNatural deduction system for three-valued Heyting's logicCorrespondence analysis and automated proof-searching for first degree entailmentNatural deduction for Fitting's four-valued generalizations of Kleene's logicsUnnamed ItemUnnamed ItemUnnamed ItemNon-transitive correspondence analysisAUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOXTwo-sided sequent calculi for \textit{FDE}-like four-valued logicsA 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 Ł3Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negationGeneralisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. BussNatural deduction for three-valued regular logicsNatural Deduction for Four-Valued both Regular and Monotonic LogicsAutomated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence AnalysisFunctional Completeness in CPL via Correspondence AnalysisThe Method of Socratic Proofs Meets Correspondence AnalysisNormalisation for Some Quite Interesting Many-Valued Logics






This page was built for publication: