scientific article

From MaRDI portal
Publication:3972527

zbMath0739.03011MaRDI QIDQ3972527

Grigori Mints

Publication date: 25 June 1992


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



Related Items (26)

Proof strategies in linear logicTableau reductions: towards an optimal decision procedure for the modal necessityCompleteness of a first-order temporal logic with time-gapsCut elimination in coalgebraic logicsA polynomial space construction of tree-like models for logics with local chains of modal connectivesFinite tree-countermodels via refutation systems in extensions of positive logic with strong negationResolution with order and selection for hybrid logicsThree faces of natural deductionIntuitionistic Decision Procedures Since Gentzen3-SAT = SAT for a class of normal modal logicsProof-terms for classical and intuitionistic resolutionA resolution theorem prover for intuitionistic logicOptimized encodings of fragments of type theory in first order logicOn temporal logic S4DbrComplexity of subclasses of the intuitionistic propositional calculusLinearizing intuitionistic implicationResolution is cut-freeDecidability of the Class E by Maslov’s Inverse MethodProof theory of Nelson's paraconsistent logic: a uniform perspectiveWhat you always wanted to know about rigid E-unificationComplexity of translations from resolution to sequent calculusProof-search in type-theoretic languages: An introductionPath calculus in the modal logic S4Resolution calculus for the first order linear logicAdmissibility of Cut in Coalgebraic LogicsClausal resolution in a logic of rational agency






This page was built for publication: