English
Related papers

Related papers: A natural deduction system for orthomodular logic

200 papers

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially…

Artificial Intelligence · Computer Science 2013-04-29 Emad Saad

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

Logic in Computer Science · Computer Science 2013-08-27 Marcelo Fiore , Ola Mahmoud

The paper studies hereditarily complete superintuitionistic deductive systems, that is, the deductive system which logic is an extension of the intuitionistic propositional logic. It is proven that for deductive systems a criterion of…

Logic · Mathematics 2016-11-16 Alex Citkin

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

Logic in Computer Science · Computer Science 2007-05-23 Victor Marek , Jan Treur , Miroslaw Truszczynski

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

It has been recently pointed out that dynamical systems depending on future values of the unknowns may be useful in different areas of knowledge. We explore in this context the extension of the concept of order reduction that has been…

Computational Physics · Physics 2007-05-23 J. M. Aguirregabiria

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the…

Logic in Computer Science · Computer Science 2022-02-14 Noah Abou El Wafa , André Platzer

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

Logic · Mathematics 2007-05-23 Mor Doron , Saharon Shelah

We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…

Logic in Computer Science · Computer Science 2019-12-06 Alejandro Díaz-Caro , Gilles Dowek

We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are…

Logic in Computer Science · Computer Science 2019-05-13 Daniel Găină , Ionuţ Ţuţu

Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for…

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

The argument is re-examined that the program of deriving the rule of state reduction from the Schroedinger equation holding for the object-apparatus composite system falls into a vicious circle or an infinite regress called the von Neumann…

Quantum Physics · Physics 2020-06-26 Masanao Ozawa

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has…

Logic in Computer Science · Computer Science 2019-03-14 Jörg Endrullis , Helle Hvid Hansen , Dimitri Hendriks , Andrew Polonsky , Alexandra Silva

We present a modal logic based approach to the so-called endophysical quantum universe. In particular, we treat the problem of preferred bases and that of state reduction by employing an eclectic collection of methods including Baltag's…

Quantum Physics · Physics 2007-05-23 A. M. Lisewski

In their seminal paper Birkhoff and von Neumann revealed the following dilemma: "... whereas for logicians the orthocomplementation properties of negation were the ones least able to withstand a critical analysis, the study of mechanics…

Logic · Mathematics 2007-05-23 Bob Coecke

Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…

Logic in Computer Science · Computer Science 2018-04-24 Luca Roversi

This paper presents State Algebra, a novel framework designed to represent and manipulate propositional logic using algebraic methods. The framework is structured as a hierarchy of three representations: Set, Coordinate, and Row…

Artificial Intelligence · Computer Science 2025-09-15 Dmitry Lesnik , Tobias Schäfer

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski
‹ Prev 1 8 9 10 Next ›