相关论文: The two halves of disjunctive correctness

We prove duality between the left and right fractional derivatives, independently on the type of fractional operator. Main result asserts that the right derivative of a function is the dual of the left derivative of the dual function or,…

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

This paper explores trivalent truth conditions for indicative conditionals, examining the "defective" table put forward by de Finetti 1936, as well as Reichenbach 1944, first sketched in Reichenbach 1935. On their approach, a conditional…

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…

Reasoning about program correctness has been a central topic in static analysis for many years, with Hoare logic (HL) playing an important role. The key notions in HL are partial and total correctness. Both require that program executions…

I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…

We study full exact functors between triangulated categories. With some hypotheses on the source category we prove that it admits an orthogonal decomposition into two pieces such that the functor restricted to one of them is zero while the…

We consider the problem of estimating counterfactual quantities when prior knowledge is available in the form of disjunctive statements. These include disjunction of conditions (e.g., "the patient is more than 60 years of age") as well as…

In the paper, the question whether truth values can be assigned to the propositions before their verification is discussed. To answer this question, a notion of a propositionally noncontextual theory is introduced that in order to explain…

Let $A$ be a pseudocompact (or profinite) algebra, so $A=C^*$ where $C$ is a coalgebra. We show that the if the semiartinian part (the "Dickson" part) of every $A$-module $M$ splits off in $M$, then $A$ is semiartinian, also giving a…

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

Given a conditional sentence "P=>Q" (if P then Q) and respective facts, four different types of inferences are observed in human reasoning. Affirming the antecedent (AA) (or modus ponens) reasons Q from P; affirming the consequent (AC)…

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

We prove that $p $-harmonic systems with antisymmetric potentials can be written in divergence form as a conservation law. This extends to the $p$-harmonic framework the original work from 2006 of the second author for $p=2$…

We discuss some surprising phenomena from basic calculus related to oscillating functions and to the theorem on the differentiability of inverse functions. Among other things, we see that a continuously differentiable function with a strict…

Let $\mathcal{T}$ be any of the three canonical truth theories $\textsf{CT}^-$ (Compositional truth without extra induction), $\textsf{FS}^-$ (Friedman--Sheard truth without extra induction), and $\textsf{KF}^-$ (Kripke--Feferman truth…

The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…

In this note we show through infinitary derivations that each provably well-founded strict partial order in ${\rm ACA}_{0}$ admits an embedding to an ordinal$<\varepsilon_{0}$.