Related papers: A note on Grigoriev and Zaitsev's system CNL$^2_4$
Gottfried Leibniz embarked on a research program to prove all the Aristotelic categorical syllogisms by diagrammatic and algebraic methods. He succeeded in proving them by means of Euler diagrams, but didn't produce a manuscript with their…
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…
Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…
This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…
The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…
The method is proposed for the study of many-point boundary value problems for systems of nonlinear ODE, by reducing them to special equivalent integral equations, and allows us [in contrast with the known method [1]] to consider boundary…
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or…
We report new results on the complexity of the valued constraint satisfaction problem (VCSP). Under the unique games conjecture, the approximability of finite-valued VCSP is fairly well-understood. However, there is yet no characterisation…
Ideas of Rozansky and Witten, as developed by Kapranov, show that a complex symplectic manifold X gives rise to Vassiliev weight systems. In this paper we study these weight systems by using D(X), the derived category of coherent sheaves on…
Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
We construct equivalences among four notions associated to a reductive group scheme $G$: factorization super central extensions of the loop group of $G$ by $\mathbb G_m$ subject to a condition on the commutator, factorization super line…
Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are formalisms for preference handling, with especially QCL being well established in the field of AI. So far, analyses of these logics need to be done on a case-by-case…
We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…
In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…
Recently, the covariant formulation of the geometric bifurcation theory, developed in a previous paper, has been applied to two elementary problems: the study of limit cycles of dynamical systems and the second part of Hilbert's sixteenth…
The recapture relationship is an important element to any understanding of the connexion between different systems of logic. Loosely speaking, one system of logic recaptures another if it is possible to specify a subsystem of the former…
Recent advances in nonlinear dynamical systems theory provide a new insight into numerical properties of discrete algorithms developed to solve nonlinear initial value problems. Basic features like accuracy and stability are well pointed…