Results 211 to 220 of about 16,441 (253)

A design-integrated framework for neuroarchitectural research. [PDF]

open access: yesFront Psychol
Wei N   +4 more
europepmc   +1 more source

A Fragment of Intuitionistic Dynamic Logic

Fundamenta Informaticae, 2001
We present a fragment of Propositional Dynamic Logic based on the Intuitionistic Propositional Logic. We show that this logic has the finite model property, and therefore, is frame-complete.
exaly   +4 more sources

Intermediate logics with the same disjunctionless fragment as intuitionistic logic

Studia Logica, 1986
An intermediate logic M is any consistent propositional logic containing intuitionistic logic I and closed under substitution and modus ponens. The author defines a sequence of formulae J as follows: start with \(\neg p\vee \neg \neg p\) and at any stage use the next sentential variable q and the formula A of the previous stage to form (q\(\to A)\vee (\
exaly   +3 more sources

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, Alexei Yu. Muravitsky
openaire   +1 more source

Logic Fragments: Coordinating Entities with Logic Programs

2016
Rigorous engineering of self-organising and self-adaptive systems is a challenging activity. Interactions with humans and unexpected entities, dependence on contextual information for self-organisation and adaptation represent just some of the factors complicating the coordination process among multiple entities of the system.
De Angelis, Francesco   +1 more
openaire   +1 more source

Reachability logic: an efficient fragment of transitive closure logic

Logic Journal of IGPL, 2000
Reachability logic (\({\mathcal RL}\)) is defined. It is a fragment of \(\text{FO}^2(\text{TC})\) (with Boolean variables), i.e. a fragment of the restriction of first-order logic with transitive closure in which only two variables may appear in a formula. It is shown that PDL and \(\text{CTL}^\star\) can be embedded in reachability logic.
Natasha Alechina, Neil Immerman
openaire   +2 more sources

Home - About - Disclaimer - Privacy