Related papers: The Consistency Correctness in CoPPar Tree
In the paper Compositionality of Component Fault Trees, we present a discussion of the compositionality of correctness of component fault trees. In this technical report, we present the formal proof of the central theorem of the…
This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".
This article is a conceptual exposition on the structure of the tree. It demonstrates an evolutionary design that the tree possesses in the perspective of a structural engineer.
We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In…
In this article we survey some of the recent developments in the structure theory of set addition.
We prove that every lattice with more than one element has a proper congruence-preserving extension.
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…
In this paper we proof that any cactus graph satisfies graph complement conjecture by finding a orthogonal representation of its complement in $\mathbb{R}^5$.
This mostly expository paper records some basic facts about towers of homotopy fiber sequences. We give a proof that a pairing of towers induces a pairing of associated spectral sequences, for towers of spaces and towers of spectra.
In this paper we present many congruences for several Ap\'ery-like sequences.
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
Adding rewriting to a proof assistant based on the Curry-Howard isomorphism, such as Coq, may greatly improve usability of the tool. Unfortunately adding an arbitrary set of rewrite rules may render the underlying formal system undecidable…
This paper is devoted to proving an infinite sequence of relations for rooted tree maps. On the way, we also give a basis for the space of rooted tree maps.
In this paper we analyse some questions concerning trees on $\kappa$, both for the countable and the uncountable case, and the connections with Cohen reals. In particular, we provide a proof for one of the implications left open in…
We investigate the consistency strength of the statement: $\kappa$ is weakly compact and there is no tree on $\kappa$ with exactly $\kappa^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed…
In this article, the author provides full details of the proof of the concordance/isotopy problem. The first published proof, [5], accomplished this task only partially since there was an error, see the erratum [6], which damaged the main…
In this paper, we state the validity of Cramer's rule in a tropical context and its correspondence with classical Cramer's rule. This correspondence will allow us to prove a constructive version of Pappus' theorem conjectured in the paper…