Related papers: Disjunctive form and the modal $\mu$ alternation h…
We define an abstract framework called {\it discrete finite differences embedding} which can be used to obtain discrete analogue of formal functional relations in the spirit of category theory. For ordinary differential equations we exhibit…
We present a new one parameter family of second derivative discontinuous solutions to the simplest scale invariant linear ordinary differential equation. We also point out how the construction could be extended to generate families of…
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…
There is a deformation of the ordinary differential calculus which leads from the continuum to a lattice (and induces a corresponding deformation of physical theories). We recall some of its features and relate it to a general framework of…
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…
Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive…
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…
Starting from the Colombeau's full generalized functions, the sharp topologies and the notion of generalized points, we introduce a new kind differential calculus (for functions between totally disconnected spaces). We study generalized…
We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
We propose an enhancement to Benders decomposition (BD) that generates valid inequalities for the convex hull of the Benders reformulation, addressing the limitation that classical BD cuts are typically tight only for the continuous…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…
This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this…
We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…
G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…
Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we are interested in the area of answer-set programming where…
Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…
In this article we show that positive surjective isometries between symmetric spaces associated with semi-finite von Neumann algebras are projection disjointness preserving if they are finiteness preserving. This is subsequently used to…
We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersection cuts from a…