Results 91 to 100 of about 200,339 (137)
DECLAREd: A Polytime LTLf Fragment
This paper considers a specification rewriting meachanism for a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, working through an equational logic and rewriting mechanism under customary practitioner assumptions from the Business
Giacomo Bergami
doaj +1 more source
Uniform Interpolation for Propositional and Modal Team Logics [PDF]
In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of the so called "existential bisimulation quantifiers", where the existence of a certain set is made modulo ...
arxiv
Hierarchies in inclusion logic with lax semantics [PDF]
We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level.
arxiv
Meaning is Use: the Case of Propositional Identity
We study natural deduction systems for a fragment of intuitionistic logic with propositional identity from the point of view of proof-theoretic semantics.
Leonard Kupś, Szymon Chlebowski
doaj +1 more source
Weak MSO: Automata and Expressiveness Modulo Bisimilarity
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to formulas $\varphi$
Carreiro, Facundo+3 more
core +1 more source
Sequent Systems for Consequence Relations of Cyclic Linear Logics
Linear Logic is a versatile framework with diverse applications in computer science and mathematics. One intriguing fragment of Linear Logic is Multiplicative-Additive Linear Logic (MALL), which forms the exponential-free component of the larger ...
Paweł Płaczek
doaj +1 more source
A \textsf{C++} reasoner for the description logic $\shdlssx$ (Extended Version)
We present an ongoing implementation of a \ke\space based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic $\dlssx$ (shortly $\shdlssx$).
Cantone, Domenico+2 more
core
On the uniform one-dimensional fragment
The uniform one-dimensional fragment of first-order logic, U1, is a recently introduced formalism that extends two-variable logic in a natural way to contexts with relations of all arities.
Kuusisto, Antti
core
Automatization of proof-search for a fragment of the first-order linear tense logic
Romas Alonderis
openalex +2 more sources
Comonadic semantics for hybrid logic and bounded fragments
Samson Abramsky, Dan Marsden
openalex +2 more sources