Related papers: Negative Translations for Affine and Lukasiewicz L…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…
This paper analyses the declarative readings of logic programming. Logic programming - and negation as failure - has no unique declarative reading. One common view is that logic programming is a logic for default reasoning, a sub-formalism…
We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…
Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…
Let $G$ be a $p$-adic Lie group with reductive Lie algebra $\mathfrak{g}$. In analogy to the translation functors introduced by Bernstein and Gelfand on categories of $U(\mathfrak{g})$-modules we consider similarly defined functors on the…
This paper studies which truth-values are most likely to be taken on finite models by arbitrary sentences of a many-valued predicate logic. We obtain generalizations of Fagin's classical zero-one law for any logic with values in a finite…
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…
This paper undertakes a foundational inquiry into logical inferentialism with particular emphasis on the normative standards it establishes and the implications these pose for classical logic. The central question addressed herein is: 'What…
Negations are key to determining sentence meaning, making them essential for logical reasoning. Despite their importance, negations pose a substantial challenge for large language models (LLMs) and remain underexplored. We constructed and…
We use the Kazhdan-Lusztig tensoring to define affine translation functors, describe annihilating ideals of highest weight modules over an affine Lie algebra in terms of the corresponding VOA, and to sketch a functorial approach to ``affine…
We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…
We construct irreducible representations of affine Khovanov-Lauda-Rouquier algebras of arbitrary finite type. The irreducible representations arise as simple heads of appropriate induced modules, and thus our construction is similar to that…
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…
Temporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity. LTL is equivalent in…
Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…
This paper is a continuation of our work concerning the logical and computational foundations of multi-step fuzzy inference. We bring further results on the implementation of the Mamdani-Assilian type of fuzzy rules and inference in Goedel…
Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk,…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
Lukasiewicz logic is a "fuzzy" logic in which truth value can be real numbers in the unit interval. There are connectives for min, max, addition and complement (1-x). The "value" of a closed formula in a fuzzy (relational model) is defined…