Results 311 to 320 of about 1,803,872 (361)

On the complexity of the closed fragment of Japaridze’s provability logic

Archive for Mathematical Logic, 2013
We consider the well-known provability logic GLP. We prove that the GLP-provability problem for polymodal formulas without variables is PSPACE-complete. For a number n, let $${L^{n}_0}$$L0n denote the class of all polymodal variable-free formulas without
F. Pakhomov
semanticscholar   +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, Di Marzo Serugendo, Giovanna   +1 more
openaire   +3 more sources

Fragments of First-Order Logic

2023
AbstractA sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. For which fragments of first-order logic is there an effective method for determining satisfiability or finite satisfiability?
openaire   +2 more sources

On the Algebraizability of the Implicational Fragment of Abelian Logic

Studia Logica, 2013
In this paper we consider the implicational fragment of Abelian logic A→. We show that although the Abelian groups provide an semantics for the set of theorems of A→ they do not for the associated consequence relation. We then show that the consequence relation is not algebraizable in the sense of Blok and Pigozzi (Mem Am Math Soc 77, 1989).
Butchart, Sam, Rogerson, Susan
openaire   +3 more sources

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.
openaire   +2 more sources

RASP and ASP as a fragment of linear logic

Journal of Applied Non-Classical Logics, 2013
Abstract RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specification and reasoning on the consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated
COSTANTINI, STEFANIA, Formisano A.
openaire   +2 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 (\
openaire   +3 more sources

Interpolation in fragments of classical linear logic

Journal of Symbolic Logic, 1994
AbstractWe study interpolation for elementary fragments of classical linear logic. Unlike in intuitionistic logic (see [Renardel de Lavalette, 1989]) there are fragments in linear logic for which interpolation does not hold. We prove interpolation for a lot of fragments and refute it for the multiplicative fragment (→, +), using proof nets and quantum ...
openaire   +3 more sources

Fragments of Default Logic

1989
In the previous chapter we furnished some insight in the use of fragments of default logic as delineated by the format of defaults they admit. The present chapter is devoted to the formal development of these fragments, including open problems.
openaire   +2 more sources

On the Complexity of Fragments of Horn Modal Logics

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME), 2016
Modal logic is a paradigm for several useful and applicable formal systems in computer science, and, in particular, for temporal logics of various kinds. It generally retains the low complexity of classical propositional logic, but notable exceptions exist that present higher complexity or are even undecidable. In search of computationally well-behaved
Bresolin, Davide, Muñoz Velasco, Emilio, SCIAVICCO, Guido   +2 more
openaire   +3 more sources