Related papers: A simple combinatorial proof for small model prope…
In this paper we provide two new semantics for proofs in the constructive modal logics CK and CD. The first semantics is given by extending the syntax of combinatorial proofs for propositional intuitionistic logic, in which proofs are…
We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between…
We study the amalgamation property in positive logic. We give some connections between the amalgamation property and Robinson theories, model-complete theories and the Hausdorff property.
Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and…
In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.
We give continuity properties of bitraces on (possibly non-commutative) Banach *-algebras based on the Closed Graph Theorem, leading to a simplified proof of the Theorem of Varopoulos in the commutative case.
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of…
A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)
We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this…
We provide a purely combinatorial proof of a skein exact sequence obeyed by double-point enhanced grid homology. We also extend the theory to coefficients over $\mathbb{Z},$ and discuss alternatives to the Ozsv\'ath-Szab\'o $\tau$…
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…
A simple proof of the weighted two variable geometric-arithmetic a mean inequality based on one given earlier valid only for integer weights
We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.
In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
We give a short proof of the Buchstaber-Rees theorem concerning symmetric powers. The proof is based on the notion of a formal characteristic function of a linear map of algebras.
We investigate a property that extends the Danos-Regnier correctness criterion for linear logic proof-structures. The property applies to the correctness graphs of a proof-structure: it states that any such graph is acyclic and the number…
Handsome proof nets were introduced by Retor\'e as a syntax for multiplicative linear logic. These proof nets are defined by means of cographs (graphs representing formulas) equipped with a vertices partition satisfying simple topological…