English
Related papers

Related papers: Uniqueness of logical connectives in a bilateralis…

200 papers

In this paper we derive intertwining relations for a broad class of conservative particle systems both in discrete and continuous setting. Using the language of point process theory, we are able to derive a natural framework in which…

Probability · Mathematics 2021-12-23 Simone Floreani , Sabine Jansen , Frank Redig , Stefan Wagner

In this study, explicit differential equations representing commutative pairs of some well-known second-order linear time-varying systems have been derived. The commutativity of these systems are investigated by considering 30 second-order…

Systems and Control · Computer Science 2020-10-05 Mehmet Emir Koksal

The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…

Artificial Intelligence · Computer Science 2023-07-04 Sophia Knight , Pavel Naumov , Qi Shi , Vigasan Suntharraj

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…

Logic in Computer Science · Computer Science 2007-05-23 Alessio Guglielmi

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…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…

Logic · Mathematics 2022-02-23 Marcelo Esteban Coniglio , Guilherme Vicentin de Toledo

For the deterministic dyadic model of turbulence, there are examples of initial conditions in $l^2$ which have more than one solution. The aim of this paper is to prove that uniqueness, for all $l^2$-initial conditions, is restored when a…

Probability · Mathematics 2009-10-28 David Barbato , Franco Flandoli , Francesco Morandin

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

Logic · Mathematics 2013-12-13 Nik Weaver

Continuous logic extends the multi-valued Lukasiewicz logic by adding a halving operator on propositions. This extension is designed to give a more satisfactory model theory for continuous structures. The semantics of these logics can be…

Artificial Intelligence · Computer Science 2013-10-15 Rob Arthan , Paulo Oliva

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino

The quest of smoothly combining logics so that connectives from classical and intuitionistic logics can co-exist in peace has been a fascinating topic of research for decades now. In 2015, Dag Prawitz proposed a natural deduction system for…

Logic in Computer Science · Computer Science 2022-04-06 Sonia Marin , Luiz Carlos Pereira , Elaine Pimentel , Emerson Sales

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

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…

Logic in Computer Science · Computer Science 2019-03-14 Witold Charatonik , Piotr Witkowski

We consider an extension of bi-intuitionistic logic with the traditional modalities from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with…

Logic in Computer Science · Computer Science 2010-06-30 Rajeev Gore , Linda Postniece , Alwen Tiu

Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this…

Artificial Intelligence · Computer Science 2007-05-23 Yan Zhang

We first present a Priestley-style dualitiy for the classes of algebras that are the algebraic counterpart of some congruential, finitary and filter-distributive logic with theorems. Then we analyze which properties of the dual spaces…

Logic · Mathematics 2025-10-14 María Esteban , Ramon Jansana

In this work we first illustrate the subjective theory of de Finetti. We recall the notion of coherence for both the betting scheme and the penalty criterion, by considering the unconditional and conditional cases. We show the equivalence…

Probability · Mathematics 2023-01-24 Angelo Gilio , Giuseppe Sanfilippo

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano