This paper introduces MetTeL2, a tableau prover generator producing Java code from the specification of a logical syntax and a tableau calculus. It is intended to provide an easy to use system for non-technical users and allow technical users to extend the generated implementations.

The phase structure of the generalized Yang–Mills theories is studied, and it is shown that almost always, it is of the third order. As a specific example, it is shown that all of the models with the interaction ∑ j (nj − j+N) exhibit third order phase transition. (nj is the length of the j-th row of the Yang tableau corresponding to U(N).) The special cases where the transition is not of the t...

We generalize the notion of a tableau of a system of partial diierential equations. This leads to an intrinsic deenition of formally well-posed initial value problems, i.e. problems with exactly the right amount of Cauchy data. We must allow here that the data is prescribed on a ag of submanifolds. The advantage of this approach is that even for non-normal systems the data can be chosen complet...

Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into Büchi automata in order to be checked. This paper describes how, by labeling automata transitions rather than states, we significantly reduce the size of autom...

When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. In this paper, we use one of the paraconsistent logics introduced in [9, 7] (LFI1) as a logical framework to model possibly inconsistent database instances obtained by integrating different sources. We propose a method based on the sound and complete tableau proof system...