This work presents the system ANITA (Analytic Tableau Proof Assistant) developed for teaching analytic tableaux to computer science students. The tool is written in Python and can be used as a desktop application, or web platform. paper describes logical of tool, explains how compares it several similar tools. has already been logic courses an evaluation presented.

An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely k inversion pairs is said to be a k-inverted semistandard Young tableau. Building upon earlier work by Fresse and the author, this paper develops generating functions for the numbers of kinv...

We present a (sound and complete) tableau calculus for Quantified Hybrid Logic (QHL). QHL is an extension of orthodox quantified modal logic: as well as the usual 2 and 3 modalities it contains names for (and variables over) states, operators @s for asserting that a formula holds at a named state, and a binder ↓ that binds a variable to the current state. The first-order component contains equa...

Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very ...

A keyH is a semi-standard tableau of partition shape whose evaluation is a permutation of the shape. We give a necessary and sufficient condition that the Knuth class of a key equals the set of shuffles of its columns. In particular, on a three-letter alphabet the Knuth class of a key equals the set of shuffles of its columns, and on a four-letter alphabet, the Knuth class of a key is either th...