Related papers: Strong Negation is Definable in 2Int
We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain…
Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…
We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
Given a 2-category $\mathcal{A}$, a $2$-functor $\mathcal{A} \overset {F} {\longrightarrow} \mathcal{C}at$ and a distinguished 1-subcategory $\Sigma \subset \mathcal{A}$ containing all the objects, a $\sigma$-cone for $F$ (with respect to…
Let p be a prime number. We give the explicit structure of 2- nilpotent multiplier for each finite 2-generator p-group of class two. Moreover, 2-capable groups in that class are characterized.
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…
We give several different encodings of the step function of a Turing machine in intuitionistic linear logic, and calculate the denotations of these encodings in the Sweedler semantics.
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove…
The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…
We prove that any multi-variate Hasse-Schmidt derivation can be decomposed in terms of substitution maps and uni-variate Hasse-Schmidt derivations. As a consequence we prove that the bracket of two $m$-integrable derivations is also…
We prove that there exist weakly countably determined spaces of complexity higher than coanalytic. On the other hand, we also show that coanalytic sets can be characterized by the existence of a cofinal adequate family of closed sets.…
An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the…
A sequential pattern with negation, or negative sequential pattern, takes the form of a sequential pattern for which the negation symbol may be used in front of some of the pattern's itemsets. Intuitively, such a pattern occurs in a…
In this note, we prove that intuitionistic modal logic LIK4 is decidable.
In this paper, we use a new method to prove cut-elimination of weak intuitionistic tense logic. This method focuses on splitting the contraction rule and cut rules. Further general theories and applications of this method shall be developed…
It is known that strongly nilpotent matrices over a division ring are linearly triangularizable. We describe the structure of such matrices in terms of the strong nilpotency index. We apply our results on quasi-translation x + H such that…