Rajeev Goré
- Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
2010/06/24 by Rajeev Goré, Rajeev Gore, Gore, Rajeev +4 · 1 citation
Computer Science · #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
- Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
2012/04/11 by Alwen Tiu, Tiu, Alwen, Egor Ianovski +4 · 1 citation
Computer Science · #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Natural Language Processing Techniques #cs.LO
- A new calculus for intuitionistic Strong Löb logic: strong termination and cut-elimination, formalised
2023/09/01 by Ian Shillito, Shillito, Ian, Iris van der Giessen +5 · 2 citations
Computer Science · #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
- Optimal and Cut-free Tableaux for Propositional Dynamic Logic with Converse
2010/01/31 by Rajeev Goré, Florian Widmann, Goré, Rajeev +1 · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #cs.LO