Related papers: Comparing truth theories based on Weak and Strong …
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…
In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded…
Counterfactual explanations shed light on the decisions of black-box models by explaining how an input can be altered to obtain a favourable decision from the model (e.g., when a loan application has been rejected). However, as noted…
A crucial issue of current text generation models is that they often uncontrollably generate factually inconsistent text with respective of their inputs. Limited by the lack of annotated data, existing works in evaluating factual…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
In this paper, we presented a new type of metric space called $(\alpha,\beta)$-metric space along with some novel contraction mappings named $(\alpha,\beta)$-contraction and weak $(\alpha,\beta)$-contraction mapping. We established some…
We establish some common fixed point results for four transformations in vector S-metric spaces by using the notion of weakly compatibility (WC) and occasionally weakly compatibility (OWC). The first theorem is proved by using the concept…
Some mathematical questions relating to Coset Conformal Field Theories (CFT) are considered in the framework of Algebraic Quantum Field Theory as developed previously by us. We consider the issue of fixed point resolution in the diagonal…
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is…
This paper introduces a formal notion of fixed point explanations, inspired by the "why regress" principle, to assess, through recursive applications, the stability of the interplay between a model and its explainer. Fixed point…
Recently, Artemov [4] offered the notion of constructive consistency for Peano Arithmetic and generalized it to constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs.…
The paper defends the thesis that analysis of truth problem in the context of interpretations of quantum logic allows to reveal the prospect of elicitation of specifics of the relations between quantum mechanics and quantum logic in a…
Wyner's soft-covering lemma is a valuable tool for achievability proofs of information theoretic security, resolvability, channel synthesis, and source coding. The result herein sharpens the claim of soft-covering by moving away from an…
We predict credit applications with off-the-shelf, interchangeable black-box classifiers and we explain single predictions with counterfactual explanations. Counterfactual explanations expose the minimal changes required on the input data…
We give a level-by-level analysis of the Weak Vop\v{e}nka Principle for definable classes of relational structures (WVP), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level.…
We consider the notion of weak permission as the failure to conclude that the opposite obligation. We investigate the issue from the point of non-monotonic reasoning, specifically logic programming and structured argumentation, and we show…
We investigate the equational theory for Kleene algebra terms with variable complements and constant complements -- (language) complement where it applies only to variables or constants -- w.r.t. languages. While the equational theory…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…