Multirole Logic (Extended Abstract)

We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this underlying set. We formalize both multirole logic (MRL) and linear multirole logic (LMRL) as natural generalizations of classical logic (CL) and classical linear logic (CLL), respectively, and also present a filter-based interpretation for intuitionism in multirole logic. Among various meta-properties established for MRL and LMRL, we obtain one named multiparty cut-elimination stating that every cut involving one or more sequents (as a generalization of a (binary) cut involving exactly two sequents) can be eliminated, thus extending the celebrated result of cut-elimination by Gentzen.

Similar Publications

We show that functions definable in power bounded $T$-convex fields have the (multidimensional) Jacobian property. Building on work of I. Halupczok, this implies that a certain notion of non-archimedean stratifications is available in such valued fields. Read More

We establish the decidability of the $\Sigma_2$ theory of $\mathscr{D}_h(\leq_h \mathcal{O})$, the hyperarithmetic degrees below Kleene's $\mathcal{O}$, in the language of uppersemilattices with least and greatest element. This requires a new kind of initial-segment result and a new extension of embeddings result both in the hyperarithmetic setting. Read More

We use edge slidings and saturated disjoint Borel families to give a conceptually simple proof of Hjorth's theorem on cost attained: if a countable p.m.p. Read More

In this paper we define when a ternary connective $m$ of an algebraic language $\mathcal{L}$ is called a DN-term of a sentential logic $\mathcal{S}$. We characterize the selfextensional logics with a DN-term as those logics that can be defined using the order induced by the interpretation of the nearlattice operation in the algebras of their algebraic counterpart. We prove that the canonical class of algebras associated with a selfextensional logic with a DN-term is a variety and we thus obtain that the logic is in fact fully selfextensional. Read More

Let $\widetilde{\mathcal M}=\langle \mathcal M, P\rangle$ be an expansion of an o-minimal structure $\mathcal M$ by a dense set $P\subseteq M$, such that three tameness conditions hold. We prove that the induced structure on $P$ by $\mathcal M$ eliminates imaginaries. As a corollary, we obtain that every small set $X$ definable in $\widetilde{\mathcal M}$ can be definably embedded into some $P^l$, uniformly in parameters. Read More

Burke \cite{MR1472122} proved that the generalized nonstationary ideal, denoted NS, is universal in the following sense: every normal ideal, and every tower of normal ideals of inaccessible height, is a canonical Rudin-Keisler projection of the restriction of $\text{NS}$ to some stationary set. We investigate how far Burke's theorem can be pushed, by analyzing the universality properties of NS with respect to the wider class of \emph{$\mathcal{C}$-systems of filters} introduced by Audrito-Steila \cite{AudritoSteila}. First we answer a question of \cite{AudritoSteila}, by proving that $\mathcal{C}$-systems of filters do not capture all kinds of set-generic embeddings. Read More

Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to obtain nice properties comparable to those of classical rough approximations. In this research paper, these ideas are generalized in a severe way by the present author and associated semantic features are investigated by her. Read More

Not all approximations arise from information systems. The problem of fitting approximations, subjected to some rules (and related data), to information systems in a rough scheme of things is known as the \emph{inverse problem}. The inverse problem is more general than the duality (or abstract representation) problems and was introduced by the present author in her earlier papers. Read More

In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show here that the answer is "yes". It follows that the absolute Vaught conjecture holds if and only if every $L_{\omega_1\omega}$-sentence with few separable randomizations has countably many countable models. Read More

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a much needed high level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or taking them into account when they are genuinely needed. A salient feature of the approach through monoidal categories is the formal graphical language of string diagrams, which supports visual reasoning about programs and computations. Read More