Related papers: On Sub-Propositional Fragments of Modal Logic

Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision problem concerning their satisfiability. We show that, although…

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with two types of…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…

We consider modal logics of products of neighborhood frames. We define n-product of modal logics as the logic of all products of neighborhood frames of corresponding logics and find n-product of any two pretransitive Horn axiomatizable…

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

We give an explicit presentation for the integral cohomology ring of the complement of any arrangement of level sets of characters in a complex torus (alias "toric arrangement"). Our description parallels the one given by Orlik and Solomon…

We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill's calculi, and focus on their fragments…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…

Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program…

The study is aimed at revealing the most important substructures (fragments) of polyenes with heteroatoms determining the alteration in the conjugation energy of the whole compound due to substitution and the relevant charge redistribution.…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…