Results 41 to 50 of about 200,339 (137)
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
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
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
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
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
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
Decision procedure for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Aida Pliuškevičienė
doaj +1 more source
Monadic Fragments of Intuitionistic Control Logic [PDF]
, 2016 We investigate monadic fragments of Intuitionistic Control Logic (ICL), which is obtained from Intuitionistic Propositional Logic (IPL) by extending language of IPL by a constant distinct from intuitionistic constants.
Glenszczyk, Anna
core +2 more sources
Incompleteness of a first-order Gödel logic and some temporal logics of programs [PDF]
, 1996 It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant ...
Baaz, Matthias +2 more
core +2 more sources