Efficient loop-check for backward proof search in some non-classical propositional logics (Q4645239): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3867808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction-free sequent calculi for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof methods for modal and intuitionistic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between propositional normal modal logics: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <b><i>O</i>(<i>n</i> log <i>n</i>)</b>-Space Decision Procedure for Intuitionistic Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636857 / rank
 
Normal rank

Latest revision as of 19:31, 17 July 2024

scientific article; zbMATH DE number 6999522
Language Label Description Also known as
English
Efficient loop-check for backward proof search in some non-classical propositional logics
scientific article; zbMATH DE number 6999522

    Statements

    Identifiers