Related papers: The two halves of disjunctive correctness
Recently, the partial information decomposition emerged as a promising framework for identifying the meaningful components of the information contained in a joint distribution. Its adoption and practical application, however, have been…
We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…
The expression for the force on an ion in the presence of current can be derived from first principles without any assumption about its conservative character. However, energy functionals have been constructed that indicate that this force…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
We consider several notions of well-foundedness of cardinals in the absence of the Axiom of Choice. Some of these have been conflated by some authors, but we separate them carefully. We then consider implications among these, and also…
Datalog+/- is a Datalog-based language family enhanced with existential quantification in rule heads, equalities and negative constraints. Query answering over databases with respect to a Datalog+/- theory is generally undecidable, however…
It was shown by Visser that Peano Arithmetic has the property that any two bi-interpretable extensions of it (in the same language) are equivalent. Enayat proposed to refer to this property of a theory as tightness and to carry out a more…
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…
We study abductive, causal, and non-causal conditionals in indicative and counterfactual formulations using probabilistic truth table tasks under incomplete probabilistic knowledge (N = 80). We frame the task as a probability-logical…
A large class of first order partial nonlinear differential equations in two independent variables which possess an infinite set of polynomial conservation laws derived from an explicit generating function is constructed. The conserved…
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
We introduce the two substructural propositional logics KL, KL+, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
We prove that any finite set of real numbers can be split into two parts, one part being highly non-additive and the other highly non-multiplicative.
We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…
We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…