Related papers: Unsound Inferences Make Proofs Shorter
I give simple elementary proofs for some well-known Hankel determinants and their q-analogues.
We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…
While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the…
The non-commutative differential calculus on quantum groups can be extended by introducing, in analogy with the classical case, inner product operators and Lie derivatives. For the case of $\GL$ we show how this extended calculus induces by…
Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and…
Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed…
Using WZ forms, Apery-style proofs of the irrationality of the q-analogues of the Harmonic seires and Ln(2) are given. For the q-analogue of Ln(2), this method of proof produces an improved irrationality measure.
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
If no optimal propositional proof system exists, we (and independently Pudl\'ak) prove that ruling out length $t$ proofs of any unprovable sentence is hard. This mapping from unprovable to hard-to-prove sentences powerfully translates facts…
We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…
We show a correspondence between simple continued fraction expansions of irrational numbers and irreducible permutative representations of the Cuntz algebra ${\cal O}_{\infty}$. With respect to the correspondence, it is shown that the…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
Information-theoretic arguments are used to obtain a link between the accurate linearity of Schrodinger's equation and Lorentz invariance: A possible violation of the latter at short distances would imply the appearance of nonlinear…
This paper concerns preprojective representations of a finite connected valued quiver without oriented cycles. For each such representation, an explicit formula in terms of the geometry of the quiver gives a unique, up to a certain…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
In a Bayesian setting, inverse problems and uncertainty quantification (UQ) - the propagation of uncertainty through a computational (forward) model - are strongly connected. In the form of conditional expectation the Bayesian update…
Practicing mathematicians often assume that mathematical claims, when they are true, have good reasons to be true. Such a state of affairs is "unreasonable", in Wigner's sense, because basic results in computational complexity suggest that…
Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence that triggers some action of the overall system, then one can…
Input/Output (I/O) logic is a general framework for reasoning about conditional norms and/or causal relations. We streamline Bochman's causal I/O logics via proof-search-oriented sequent calculi. Our calculi establish a natural syntactic…
Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…