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
The strong decidability of cut-logics. I: Partial propositional calculi - MaRDI portal

The strong decidability of cut-logics. I: Partial propositional calculi

From MaRDI portal

Publication:2536052

Jump to:navigation, search

DOI10.1305/ndjfl/1093894295zbMath0185.02401OpenAlexW2084459254MaRDI QIDQ2536052

E. William jun. Chapin

Publication date: 1971

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093894295

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (1)

Measures of centrality and complexity for partial propositional calculi

This page was built for publication: The strong decidability of cut-logics. I: Partial propositional calculi

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2536052&oldid=15268131"