English
Related papers

Related papers: Two principles in many-valued logic

200 papers

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Artificial Intelligence · Computer Science 2017-04-05 David Billington

A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…

Logic · Mathematics 2021-07-13 T. Moraschini

We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (`Modal logics with Belnapian truth values', J. Appl. Non-Class. Log. 20, 279--301 (2010)). We…

Logic in Computer Science · Computer Science 2016-08-23 Igor Sedlár

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

Logic in Computer Science · Computer Science 2021-10-04 Florian Chudigiewitsch

Scholars have wondered for a long time whether quantum mechanics (QM) subtends a quantum concept of truth which originates quantum logic (QL) and is radically different from the classical (Tarskian) concept of truth. We show in this paper…

Quantum Physics · Physics 2007-05-23 Claudio Garola

Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…

Logic in Computer Science · Computer Science 2019-06-28 Anantha Padmanabha , R. Ramanujam

Knowing whether a proposition is true means knowing that it is true or knowing that it is false. In this paper, we study logics with a modal operator Kw for knowing whether but without a modal operator K for knowing that. This logic is not…

Artificial Intelligence · Computer Science 2013-12-13 Jie Fan , Yanjing Wang , Hans van Ditmarsch

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

Contrary to classical semantics, the disjunction of two experimental propositions relating to pure states of a quantum system ("quantum propositions" for short) can be true even in the case where neither disjunct is true. This suggests that…

Quantum Physics · Physics 2018-10-24 Arkady Bolotin

The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead…

Logic in Computer Science · Computer Science 2015-09-30 Timothy J. Armstrong

An exhaustive survey of categorical propositions is proposed in the present paper, both with respect to their nature and the logical problems raised by them. Through a comparative analysis of Term Logic and First-Order Logic, it is shown…

Logic in Computer Science · Computer Science 2022-04-15 Fabien Schang , George Englebretsen , J. -Martín Castro-Manzano

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

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 Value Coalition Logic, a typed assignment-based reconstruction of classical coalition logic. The strategic semantics is unchanged: coalitional ability is still interpreted by the standard one-step game-form clause. The change…

Logic in Computer Science · Computer Science 2026-05-26 Shanxia Wang

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic…

Logic · Mathematics 2024-11-20 Bruno da Ré , Damian Szmuc , Emmanuel Chemla , Paul Égré

In this short note we compare the expressive power of real-valued continuous logic (or just continuous logic, in recent literature) with that of compact-valued continuous logic, proposed by Chang and Keisler. We conclude that the two logics…

Logic · Mathematics 2022-07-06 Itaï Ben Yaacov

This article discusses the logical errors in the liar paradox, G\"odel's incompleteness theorems, Russell's paradox, and the halting problem. In order to avoid these errors, a redefinition of logic has been presented, which is concluded as…

General Mathematics · Mathematics 2023-08-21 Xuezhi Yang

Inspired by the early Wittgenstein's concept of nonsense (meaning that which lies beyond the limits of language), we investigate two different types of nonsense: formal nonsense and pragmatic nonsense. The simpler notion of formal nonsense…

Anhomomorphic logic is a new interpretation of Quantum Theory (due to R. Sorkin). It is a histories formulation (c.f. consistent histories, quantum measure theory). In this approach, reality is a co-event, which is essentially an assignment…

Quantum Physics · Physics 2009-07-07 Yousef Ghazi-Tabatabai , Petros Wallden

Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…

Logic in Computer Science · Computer Science 2017-01-11 Martin Grohe , Nicole Schweikardt