Related papers: Filter-induced entailment relations in paraconsist…
We investigate neg(ation)-raising inferences, wherein negation on a predicate can be interpreted as though in that predicate's subordinate clause. To do this, we collect a large-scale dataset of neg-raising judgments for effectively all…
We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…
Inductive definitions are an important form of knowledge. The logic FO(ID) is an extension of classical first-order logic FO with general non-monotone inductive definitions. Most existing proof systems for inductive definitions impose…
In this paper, we will provide a method to compute the density of tautologies among the set of well-formed formulae consisting of $m$ variables, the negation symbol and the implication symbol; which has a possibility to be applied for other…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
In a nutshell, we intend to extend Schoenberg's classical theorem connecting conditionally positive semidefinite functions $F\colon \mathbb{R}^n \to \mathbb{C}$, $n \in \mathbb{N}$, and their positive semidefinite exponentials $\exp(tF)$,…
In this article, we have introduced a Logic of Formal Inconsistency (LFI) that we call $\vd$. This logic is non-self-extensional, i.e., the replacement property, or the rule for substitution of equivalents, does not hold. A Hilbert-style…
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of 'strong equivalence' between logical programs that can be verified in 3-valued Goedel logic, G3,…
Team Semantics is a generalization of Tarskian Semantics that can be used to add to First Order Logic atoms and connectives expressing dependencies between the possible values of variables. Some of these extensions are more expressive than…
We study cohomology for classical Lie superalgebras $\mathfrak{g}$ (e.g. gl(m|n)) over the complex numbers. Using results from invariant theory, we show that there exist subsuperalgebras which detect the cohomology of $\mathfrak{g}.$…
In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.
We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…
In this article, we try to formulate a definition of ''many-valued logical structure''. For this, we embark on a deeper study of Suszko's Thesis ($\mathbf{ST}$) and show that the truth or falsity of $\mathbf{ST}$ depends, at least, on the…
Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…
We present an extension of Logic Programming (under stable models semantics) that, not only allows concluding whether a true atom is a cause of another atom, but also deriving new conclusions from these causal-effect relations. This is…
Coalition Logic is primarily concerned with what coalitions can achieve, whereas what coalitions cannot achieve -- their \emph{inability} -- has received comparatively little explicit attention. This asymmetry matters in artificial…
Let $G$ be a finite group and $\phi : V\to W$ an equivariant morphism of finite dimensional $G$-modules. We say that $\phi$ is faithful if $G$ acts faithfully on $\phi(V)$. The covariant dimension of $G$ is the minimum of the dimension of…
Rules in logic programming encode information about mutual interdependencies between literals that is not captured by any of the commonly used semantics. This information becomes essential as soon as a program needs to be modified or…
Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-founded sets and iterated induction. In this work, we define a logic formalizing…
Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…