Pages that link to "Item:Q688732"
From MaRDI portal
The following pages link to Complexity of subclasses of the intuitionistic propositional calculus (Q688732):
Displaying 7 items.
- Intuitionistic formal theories with realizability in subrecursive classes (Q1377631) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- (Q3505074) (← links)
- A computational complexity of decision procedure for the intuitionistic logic without weakening rule (Q4000672) (← links)
- (Q4263808) (← links)
- TRANSITIVE PRIMAL INFON LOGIC (Q4928774) (← links)
- Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis (Q5038472) (← links)