English
Related papers

Related papers: Negation and Implication in Partition Logic

200 papers

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

This paper discusses the no-cloning theorem in a logico-algebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning…

Quantum Physics · Physics 2009-10-21 Takayuki Miyadera , Hideki Imai

This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…

Artificial Intelligence · Computer Science 2019-10-16 Niki Pfeifer

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the…

Artificial Intelligence · Computer Science 2013-12-24 Joost Vennekens

In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to…

Logic in Computer Science · Computer Science 2020-09-25 Robin Kaarsgaard

We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with…

Quantum Physics · Physics 2013-06-20 Samson Abramsky , Ross Duncan

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…

Logic · Mathematics 2013-04-17 Pietro Galliani , Miika Hannula , Juha Kontinen

Simple continued fractions, base-b expansions, Dedekind cuts and Cauchy sequences are common notations for number systems. In this note, first, it is proven that both simple continued fractions and base-b expansions fail to denote real…

General Mathematics · Mathematics 2021-02-05 Pith Xie

It is argued that the orthodox interpretation of quantum mechanics is in conflict with the objective existence of space-time, and suggested that kets are labels which name real states of matter but do not directly describe them. Position is…

General Physics · Physics 2014-05-13 Charles Francis

Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual characterization results and insights from unified correspondence…

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

Logic · Mathematics 2009-09-29 Kai Bruennler

We define the category $\mathcal{QM}$ of quantales and their modules and prove the existence of coproducts, and the one of pushout and amalgamated coproducts under certain conditions. Then we define the non-full subcategory…

Logic · Mathematics 2025-08-28 Ciro Russo

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Johannes Heidema , Thomas Meyer

The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…

Logic in Computer Science · Computer Science 2009-09-25 Marc Denecker

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

Logic in Computer Science · Computer Science 2021-04-12 Miika Hannula , Minna Hirvonen , Juha Kontinen

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

Boolean spaces with internal semigroups generalize profinite semigroups and are pertinent for the recognition of not-necessarily regular languages. Via recognition, the study of existential quantification in logic on words amounts to the…

General Topology · Mathematics 2019-01-18 Célia Borlido , Mai Gehrke

We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…

Artificial Intelligence · Computer Science 2013-02-28 Philippe Besnard , Jerome Lang