The following pages link to Ryo Kashima (Q676307):
Displayed 22 items.
- Contraction-elimination for implicational logics (Q676308) (← links)
- Reduction rules for intuitionistic \(\lambda\rho\)-calculus (Q897480) (← links)
- Cut-free sequent calculi for some tense logics (Q1317905) (← links)
- Sequent calculi for Visser's propositional logics (Q1409300) (← links)
- Substructural implicational logics including the relevant logic E (Q1970643) (← links)
- Term-space semantics of typed lambda calculus (Q1981989) (← links)
- (Q2904055) (← links)
- General Models and Completeness of First-Order Modal -calculus (Q3520232) (← links)
- (Q4032538) (← links)
- Cut‐Elimination Theorem for the Logic of Constant Domains (Q4304102) (← links)
- On the Difficulty of Writing Out formal Proofs in Arithmetic (Q4351922) (← links)
- On semilattice relevant logics (Q4419270) (← links)
- Kripke Completeness of First-Order Constructive Logics with Strong Negation (Q4465165) (← links)
- Completeness of implicational relevant logics (Q4521284) (← links)
- (Q4548529) (← links)
- (Q4703130) (← links)
- (Q4704073) (← links)
- An axiomatization of ECTL (Q5406125) (← links)
- Sequent Calculi for Some Strict Implication Logics (Q5460206) (← links)
- On the completeness and the decidability of strictly monadic second‐order logic (Q6047662) (← links)
- Semantical cut-elimination for the provability logic of true arithmetic (Q6450775) (← links)
- Cut-free sequent calculi for the provability logic D (Q6456612) (← links)