Related papers: Semantic interpolation
Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…
This chapter provides a comprehensive overview of proof-theoretic methods for establishing interpolation properties across a range of logics, including classical, intuitionistic, modal, and substructural logics. Central to the discussion…
We use reproducing kernel methods to study various rigidity problems. The methods and setting allow us to also consider the non-positive case.
We describe an inventory of semantic relations that are expressed by prepositions. We define these relations by building on the word sense disambiguation task for prepositions and propose a mapping from preposition senses to the relation…
The theory of computational complexity is used to underpin a recent model of neocortical sensory processing. We argue that encoding into reconstruction networks is appealing for communicating agents using Hebbian learning and working on…
We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff's Equational Logic and a new…
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which…
In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…
We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the…
Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…
We give a systematic treatment to the concept of hypoellipticity, putting it into an abstract form which allows us to deal with several different notions within the same framework. We then investigate when a notion of hypoellipticity…
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…
A semantical embedding of input/output logic in classical higher-order logic is presented. This embedding enables the mechanisation and automation of reasoning tasks in input/output logic with off-the-shelf higher-order theorem provers and…
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…
We give description of rational solutions of polynomial-equations.
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for…
Using algebraic methods, and motivated by the one variable case, we study a multipoint interpolation problem in the setting of several complex variables. The duality realized by the residue generator associated with an underlying Gorenstein…
The article suggests a description of a system of tables with a set of special lists absorbing a semantics of data and reflects a fullness of data. It shows how their parallel processing can be constructed based on the descriptions. The…
The typical mathematical language systematically exploits notational and logical abuses whose resolution requires not just the knowledge of domain specific notation and conventions, but not trivial skills in the given mathematical…