Related papers: The external version of a subclassical logic
In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation…
We study a logic-based approach to versioning of ontologies. Under this view, ontologies provide answers to queries about some vocabulary of interest. The difference between two versions of an ontology is given by the set of queries that…
Linear logical frameworks with subexponentials have been used for the specification of among other systems, proof systems, concurrent programming languages and linear authorization logics. In these frameworks, subexponentials can be…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…
We study the subspace of the exterior algebra of a simple complex Lie algebra linearly spanned by the copies of the little adjoint representation or, in the case of the Lie algebra of traceless matrices, by the copies of the n-th symmetric…
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
The property of degeneration of modular graded Lie algebras, first investigated by B. Weisfeiler, is analyzed. Transitive irreducible graded Lie algebras $L=\sum_{i\in \mathbb Z}L_i,$ over an algebraically closed field of characteristic…
It is well-known that Leonard pairs have a close connection with bispectral orthogonal polynomials of the Askey scheme. In this paper, we introduce the notion of a Leonard trio $(V,\oV,Z)$, an algebraic structure extending Leonard pairs,…
This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…
Local Completeness Logic (LCL) has been put forward as a program logic for proving both the correctness and incorrectness of program specifications. LCL is an abstract logic, parameterized by an abstract domain that allows combining over-…
This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports…
The linear PDE ${\mathbf B} {\mathbf L} (\frac{\partial}{\partial x}) u ={\mathbf L}_1(\frac{\partial}{\partial x})u +f(x)$ with nonclassic conditions on boundary $\partial \Omega$ is considered. Here ${\mathbf B}$ is linear noninvertible…
Given a positive integer d, the Kaplansky-Lvov conjecture states that the set of values of a multilinear noncommutative polynomial f on the matrix algebra M_d(C) is a vector subspace. In this article the technique of using one-wiggle…
We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as…
Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of…
Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a new theory required for each variation of the language or of…
Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition…
We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics…