Results 301 to 310 of about 1,803,872 (361)

Tractable Reasoning in a Fragment of Separation Logic [PDF]

open access: yesInternational Conference on Concurrency Theory, 2011
In 2004, Berdine, Calcagno and O'Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed that entailment in this fragment is in coNP, but the precise complexity of this problem has been open since.
B. Cook   +4 more
semanticscholar   +4 more sources

Lattice logic as a fragment of (2-sorted) residuated modal logic

J. Appl. Non Class. Logics, 2018
Correspondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility ...
Chrysafis Hartonas
semanticscholar   +1 more source

Quantum Logic as a Fragment of Independence-Friendly Logic [PDF]

open access: possibleJournal of Philosophical Logic, 2002
The author presents his hypothesis that noncommuting variables are irreducibly interdependent in the logic connected with the foundations of quantum mechanics. The logic of such dependence relations is presented as independence-friendly logic, previously introduced by the author, which uses a sentence-initial contradictory negation over and above the ...
openaire   +1 more source

On superintuitionistic logics as fragments of proof logic extensions

Studia Logica, 1986
Let I be the intuitionistic propositional calculus, \(Grz=S4+\square (\square (p\to \square p)\to p)\to p\) be Grzegorczyk's logic, G be proof logic, i.e. the extension of classical propositional calculus by the new connective \(\Delta\), the axiom-schemes \(\Delta\) (p\(\to q)\to (\Delta p\to \Delta q)\) and \(\Delta\) (\(\Delta\) \(p\to p)\to \Delta ...
A. V. Kuznetsov, A. Yu. Muravitsky
openaire   +2 more sources

On fragments of Medvedev's logic

Studia Logica, 1981
Medvedev's intermediate logic (MV) can be defined by means of Kripke semantics as the family of Kripke frames given by finite Boolean algebras without units as partially ordered sets. The aim of this paper is to present a proof of the theorem: For every set of connectivesΦ such that\(\{ \to , \vee , \urcorner \} \not \subseteq \Phi \subseteq \{ \to ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy