Related papers: Completeness in local positive logic
We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…
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…
We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…
We study the basic properties of a dual "spectral" topology on positive type spaces of h-inductive theories and its essential connection to infinitary logic. The topology is Hausdorff, has the Baire property, and its compactness…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…
In this paper we continue the exploration of the classes of positively closed and h-maximal model of an h-inductive theory in the context of positive logic. In the section 2 we give a concrete description of the class of h-maximal models of…
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…
Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…
We introduce the notion of positive local combinatorial dividing-lines in model theory. We show these are equivalently characterized by indecomposable algebraically trivial Fraisse classes and by complete prime filter classes. We exhibit…
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…
We give a new, direct proof of the tetrachotomy classification for the model-checking problem of positive equality-free logic parameterised by the model. The four complexity classes are Logspace, NP-complete, co-NP-complete and…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…