Author of the publication

Synthetic completeness proofs for Seligman-style tableau systems.

, , , and . Advances in Modal Logic, page 302-321. College Publications, (2016)

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

A Logical Approach To Arabic Phonology., and . EACL, page 89-94. The Association for Computer Linguistics, (1991)A Specification Language for Lexical Functional Grammars., and . EACL, page 39-44. The Association for Computer Linguistics, (1995)Terminating Tableau Calculi for Hybrid Logics Extending K., and . M4M, volume 231 of Electronic Notes in Theoretical Computer Science, page 21-39. Elsevier, (2007)The New Trivium.. FLAP, (2017)Formalizing a Seligman-Style Tableau System for Hybrid Logic - (Short Paper)., , and . IJCAR (1), volume 12166 of Lecture Notes in Computer Science, page 474-481. Springer, (2020)Modeling the clarification potential of instructions: Predicting clarification requests and other reactions., and . Comput. Speech Lang., (2017)Nominal Tense Logic.. Notre Dame J. Formal Log., 34 (1): 56-83 (1993)Completeness in Hybrid Type Theory., , , and . J. Philos. Log., 43 (2-3): 209-238 (2014)Termination for Hybrid Tableaus., and . J. Log. Comput., 17 (3): 517-554 (2007)A Seligman-Style Tableau System., , , and . LPAR, volume 8312 of Lecture Notes in Computer Science, page 147-163. Springer, (2013)