Results 41 to 50 of about 155,122 (304)
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +1 more source
The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations [PDF]
, 2019 We argue that European transport regulations can be formalized within the Sigma^1_1 fragment of monadic second order logic, and possibly weaker fragments including linear temporal logic.
+4 more
core +2 more sources
Covering and separation for logical fragments with modular predicates [PDF]
Logical Methods in Computer Science, 2019 For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first language, while being ...
Thomas Place +2 more
doaj +1 more source
Disjunctive bases: normal forms and model theory for modal logics [PDF]
Logical Methods in Computer Science, 2022 We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the ...
Sebastian Enqvist, Yde Venema
doaj +1 more source
Using Program Synthesis for Program Analysis [PDF]
, 2015 In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g.
David, Cristina +2 more
core +3 more sources
On Sub-Propositional Fragments of Modal Logic
Logical Methods in Computer Science, 2018 In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the so-called core fragment, defined as the intersection of the Horn and the Krom fragments, plus their sub-fragments obtained
Bresolin, Davide +2 more
openaire +6 more sources
MALL proof equivalence is Logspace-complete, via binary decision diagrams [PDF]
, 2015 Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets:
Bagnol, Marc
core +3 more sources
Decision procedure for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Aida Pliuškevičienė
doaj +1 more source
Logical Methods in Computer Science, 2013 We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable.
Luc Segoufin, Balder ten Cate
doaj +1 more source
A Variant of Material Connexive Logic
Bulletin of the Section of Logic, 2021 The relationship between formal (standard) logic and informal (common-sense, everyday) reasoning has always been a hot topic. In this paper, we propose another possible way to bring it up inspired by connexive logic.
Alexander Belikov, Dmitry Zaitsev
doaj +1 more source