Related papers: A note on Grigoriev and Zaitsev's system CNL$^2_4$
Provability logics are modal or polymodal systems designed for modeling the behavior of G\"odel's provability predicate in arithmetical theories and its natural extensions. If \Lambda is any ordinal, the G\"odel-L\"ob calculus GLP(\Lambda)…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
One of the authors has recently introduced the concept of conjugate Hamiltonian systems: the solution of the equation $h=H(p,q,t),$ where $H$ is a given Hamiltonian containing $t$ explicitly, yields the function $t=T(p,q,h)$, which defines…
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k \leq y + k'. Over integers, the satisfiability problem for such systems is polynomial time. The problem becomes NP complete if we restrict…
The purpose of this note is to provide a transparent and unified retelling of both Skvortsov's proof of the structural completeness of Medvedev's logic of finite problems, which is a classical result originally due to Prucnal, and of…
The complex Langevin approach is a promising method for the numerical treatment of systems with a sign problem, for which conventional lattice field theory techniques based on importance sampling cannot be applied. However, complex Langevin…
This paper aims at providing a comprehensive solution to the archaic open problem: how to define semantics of three-valued modal logic with vivid intuitive picture, convincing philosophical justification as well as versatile practical…
We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has variables for strategies that are associated to specific agents with a binding operator. We introduce Graded Strategy…
It is not uncommon for a logic to be invented multiple times, hinting at its robustness. This trend is followed also by the expansion BD+ of Belnap-Dunn logic by Boolean negation. Ending up in the same logic, however, does not mean that the…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
In this paper, we study a new Kripke-style semantics for classical modal logic, named as provability models. We study provability models for the propositional modal logics K, K4, S4 GL, GLP and the interpretability logic ILM. Provability…
We consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses inductive definitions to describe networks with an unbounded…
In the present paper we consider the simplest non-classical extension $GL4$ of the well-known propositional provability logic $GL$ together with the notion of expressibility of formulas in a logic proposed by A. V. Kuznetsov. Conditions for…
The paper addresses a conjecture of Shapiro and Tater on the similarity between two sets of points in the complex plane; on one side is the values of $t\in \mathbb{C}$ for which the spectrum of the quartic anharmonic oscillator in the…
Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…
The paper extends the well-known Lyusternik-Graves theorem for set-valued mappings to the Holder framework, offers an affirmative answer to an open problem proposed by Dontchev and improves recent results of He and Ng. Primal and dual…
Recently, a plethora of multivariable knot polynomials were introduced by Kashaev and one of the authors, by applying the Reshetikhin-Turaev functor to rigid $R$-matrices that come from braided Hopf algebras with automorphisms. We study the…
In the paper by Sivatharani et al [1], the authors make a tall claim about the integrability of a 2 component (2+1) dimensional Long wave Short wave Resonance Interaction (2C(2+1)LSRI) equation with mixed sign which was already claimed to…