Related papers: Adding an Implication to Logics of Perfect Paradef…
We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly…
We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…
We study the spectrum generating closed nonlinear superconformal algebra that describes $\mathcal{N}=2$ super-extensions of rationally deformed quantum harmonic oscillator and conformal mechanics models with coupling constant $g=m(m+1)$,…
The paper studies the containment companion of a logic $\vdash$. This consists of the consequence relation $\vdash^{r}$ which satisfies all the inferences of $\vdash$, where the variables of the conclusion are \emph{contained} into those of…
In a recent work Foulis and Pulmannov\' a \cite{Foulis2012} studied the logical connectives in lattice effect algebras. In this paper we extend their study and investigate further the logical calculus for which the lattice effect algebras…
New deformed affine algebras A_{\hbar,\eta}(\hat{g}) are defined for any simply-laced classical Lie algebra g, which are generalizations of the algebra A_{\hbar,\eta}(\hat{sl_2}) recently proposed by Khoroshkin, Lebedev and Pakuliak (KLP).…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…
We study evolution algebras of arbitrary dimension. We analyze in deep the notions of evolution subalgebras, ideals and non-degeneracy and describe the ideals generated by one element and characterize the simple evolution algebras. We also…
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…
This thesis is divided into two parts. In the first part we study completely integrable systems, and their underlying structures, in detail. We study their deformation theory and the different equivalence relations surrounding it. We…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…
A classic result of representation theory is Brauer's construction of a diagrammatical (geometrical) algebra whose matrix representation is a certain given matrix algebra, which is the commutating algebra of the enveloping algebra of the…
We present a detailed study of a parametric Lie algebra encompassing the symmetry algebras of various models, both continuous and discrete. This algebraic structure characterizes the isotropic oscillator (with positive, purely imaginary,…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…