Author of the publication

Evaluating Networks of Arguments: A Case Study in Mīmāṃsā Dialectics.

, , , and . LORI, volume 11813 of Lecture Notes in Computer Science, page 355-369. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Automated Generation of Analytic Calculi for Logics with Linearity.. CSL, volume 3210 of Lecture Notes in Computer Science, page 503-517. Springer, (2004)Cut Elimination for First Order Gödel Logic by Hyperclause Resolution., , and . LPAR, volume 5330 of Lecture Notes in Computer Science, page 451-466. Springer, (2008)Hypersequent Calculi for Gödel Logics - a Survey., , and . J. Log. Comput., 13 (6): 835-861 (2003)A Sufficient Condition for Completability of Partial Combinatory Algebras., and . J. Symb. Log., 62 (4): 1209-1214 (1997)Display to Labeled Proofs and Back Again for Tense Logics., , , and . ACM Trans. Comput. Log., 22 (3): 20:1-20:31 (2021)Proof theory of witnessed Gödel logic: A negative result., and . J. Log. Comput., 26 (1): 51-64 (2016)Editorial., , , and . Log. J. IGPL, 13 (4): 363 (2005)First-order satisfiability in Gödel logics: An NP-complete fragment., , and . Theor. Comput. Sci., 412 (47): 6612-6623 (2011)Algebraic proof theory: Hypersequents and hypercompletions., , and . Ann. Pure Appl. Log., 168 (3): 693-737 (2017)Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving., , and . LPAR, volume 2250 of Lecture Notes in Computer Science, page 201-215. Springer, (2001)