Related papers: Two strong undefinability results in inquisitive a…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
The paper studies hereditarily complete superintuitionistic deductive systems, that is, the deductive system which logic is an extension of the intuitionistic propositional logic. It is proven that for deductive systems a criterion of…
I show that the strong negation is definable in 2Int, Wansing's bi-intuitionistic logic.
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…
We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…
We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.
Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…
This paper provides a novel metametaphysical approach to quantum indeterminacy. More specifically, it argues that bivalent quantum logic can successfully account for this kind of indeterminacy, given the non-truth-functional character of…
The tension between deduction and induction is perhaps the most fundamental issue in areas such as philosophy, cognition and artificial intelligence (AI). The deduction camp concerns itself with questions about the expressiveness of formal…
We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing context free languages given by Lautemann, Schwentick and Th\'erien [18]…
We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
We prove that adding upwards closed first-order dependency atoms to first-order logic with team semantics does not increase its expressive power (with respect to sentences), and that the same remains true if we also add constancy atoms. As…
The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…
We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice…
Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives. We show…
It is shown that the compositum $ \mathbb Q^{(2)}$ of all degree 2 extensions of $\mathbb Q$ has undecidable theory.
We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.