Results 31 to 40 of about 165,831 (331)

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, Kroening, Daniel, Lewis, Matt   +2 more
core   +4 more sources

On two-variable guarded fragment logic with expressive local Presburger constraints [PDF]

Logical Methods in Computer Science
We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at ...
Chia-Hsuan Lu, Tony Tan
doaj   +1 more source

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

A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita, Shigeki Hagihara, Naoki Yonezaki   +2 more
doaj   +1 more source

On decidability of a fragment of intuitionistic predicate logic

Lietuvos Matematikos Rinkinys, 1999
There is not abstract.
Jolanta Kaušilaitė , Regimantas Pliuškevičius   +1 more
doaj   +3 more sources

From formulas to cirquents in computability logic [PDF]

Logical Methods in Computer Science, 2011
Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic ...
Giorgi Japaridze
doaj   +1 more source

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, Varun Ramanathan, Pascal Weil   +2 more
doaj   +1 more source

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

Fragmenting modal logic

Inquiry
Fragmentalism allows incompatible facts to constitute reality in an absolute manner, provided that they fail to obtain together. In recent years, the view has been extensively discussed, with a focus on its formalisation in modeltheoretic terms. This paper focuses on three formalisations: Lipman’s approach, the subvaluationist interpretation, and a ...
Samuele Iaquinto, Ciro De Florio, Aldo Frigerio   +2 more
openaire   +3 more sources

Monadic Fragments of Intuitionistic Control Logic [PDF]

Bulletin of the Section of Logic, 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. In particular we present the complete description of purely negational fragment and show that most of monadic fragments are finite.
openaire   +4 more sources