We present LogAG, an algebraic language for reasoning about graded propositions. LogAG is algebraic in that it is a language of only terms, some of which denote propositions. Both propositions and their grades are taken as individuals in the LogAG ontology. Thus, the language includes terms denoting graded propositions, grades of propositions, grading propositions, and graded grading propositio...

Evidence occupies a paramount position in any logical endeavor and research article is consensually considered a predominant site of such an endeavor. One interesting area of rhetoric which addresses the source and reliability of evidence is quality metadiscourse. In this qualitative study, quality metadiscourse strategies (i.e., evidentials, hedges, boosters and disclaimers) are examined to in...

The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata or rectangular hybrid systems. In this paper we enlarge the class of systems amenable to algorithmic analysis and synthesis by showing decidability of model checking Linear Temporal Logic (LTL) formulas over discrete time, contro...

Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line of work by Honda (1993), by Honda, Kubo, and Vasconcelos (1998), and by Gay and Vasconcelos (2010), among others, this paper presents GV, a line...