English
Related papers

Related papers: A Note on a Modified Catuskoti

200 papers

Although the so called tetralemma might seem to be incompatible with any recognized scheme of logical inference, its four alternatives arise naturally within the anhomomorphic logics which have been proposed in order to accommodate certain…

Logic · Mathematics 2015-05-19 Rafael D. Sorkin

In the present article, we explore a new approach for the study of orthomodular lattices, where we replace the problematic conjunction by a binary operator, called the Sasaki projection. We present a characterization of orthomodular…

Logic in Computer Science · Computer Science 2007-05-23 Olivier Brunet

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…

Logic in Computer Science · Computer Science 2014-11-27 Richard Prideaux Evans , Martin Berger

A holistic extension of classical propositional logic is introduced in the framework of quantum computation with mixed states. The concepts of tautology and contradiction are investigated in this extensions. A special family of quantum…

Quantum Physics · Physics 2019-04-10 H. Freytes , R. Giuntini , G. Sergioli

This paper presents an alternative approach to quantum entanglement, one that effectively resolves the logical inconsistencies without leading to logical contradictions. By addressing some of the inconsistencies within quantum mechanics,…

Quantum Physics · Physics 2024-05-15 Pouria Abbasalinejad , Hamid Tebyanian

The field of proof-theoretic semantics (P-tS) offers an alternative approach to meaning in logic that is based on inference and argument (rather than truth in a model). It has been successfully developed for various logics; in particular,…

Logic · Mathematics 2025-03-10 Alexander V. Gheorghiu , Yll Buzoku

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

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Logic in Computer Science · Computer Science 2007-05-23 Jørgen Villadsen

A thorough investigation of the foundations of paraconsistent logics. Relations between logical principles are formally studied, a novel notion of consistency is introduced, the logics of formal inconsistency, and the subclasses of…

Logic · Mathematics 2007-05-23 W. A. Carnielli , J. Marcos

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

Topological semantics for modal logics has recently gained new momentum in many different branches of logic. In this paper, we will consider the topological semantics of both classical and paraconsistent modal logics. This work is a new…

Logic · Mathematics 2011-08-19 Can Baskent

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…

Logic · Mathematics 2025-10-14 Oscar Ramírez

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

Logic · Mathematics 2013-12-17 Jesse Alama

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…

Logic · Mathematics 2023-01-31 Takahiro Yamada

Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…

Logic · Mathematics 2015-06-11 Maokang Luo , Wei He

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…

Logic in Computer Science · Computer Science 2024-04-19 Ian Pratt-Hartmann

A survey of paraconsistent logics that are prominent representatives of the different approaches that have been followed to develop paraconsistent logics is provided. The paraconsistent logics that will be discussed are an enrichment of…

Logic in Computer Science · Computer Science 2017-11-15 C. A. Middelburg

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…

Logic in Computer Science · Computer Science 2022-10-17 Pablo Barenbaum , Teodoro Freund
‹ Prev 1 2 3 10 Next ›