Results 41 to 50 of about 2,593,900 (78)
On shuffle products, acyclic automata and piecewise-testable languages
, 2019 We show that the shuffle $L \unicode{x29E2} F$ of a piecewise-testable language $L$ and a finite language $F$ is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable languages.
Halfon, Simon, Schnoebelen, Philippe
core +1 more source
Non-associative and projective linear logics [PDF]
arXiv, 2022 A non-commutative, non-associative weakening of Girard's linear logic is developed for multiplicative and additive connectives. Additional assumptions capture the logic of quantic measurements.
arxiv
Complexity Results for Modal Dependence Logic [PDF]
, 2010 Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is determined by those of ...
F.M. Donini +8 more
core +3 more sources
arXiv, 2023 This paper develops a {\em qualitative} and logic-based notion of similarity from the ground up using only elementary concepts of first-order logic centered around the fundamental model-theoretic notion of type.
arxiv
Logic Column 18: Alternative Logics: A Book Review [PDF]
arXiv, 2007 This article discusses two books on the topic of alternative logics in science: "Deviant Logic", by Susan Haack, and "Alternative Logics: Do Sciences Need Them?", edited by Paul Weingartner.
arxiv
Preservation and decomposition theorems for bounded degree structures [PDF]
, 2015 We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad ...
Harwath, Frederik +2 more
core +2 more sources
Mathematical Logic in Computer Science [PDF]
arXiv, 2018 The article retraces major events and milestones in the mutual influences between mathematical logic and computer science since the 1950s.
arxiv
Property Checking Without Invariant Generation
, 2020 We introduce a procedure for proving safety properties. This procedure is based on a technique called Partial Quantifier Elimination (PQE). In contrast to complete quantifier elimination, in PQE, only a part of the formula is taken out of the scope of ...
Goldberg, Eugene
core
An Application Specific Informal Logic for Interest Prohibition Theory [PDF]
, 2011 Interest prohibition theory concerns theoretical aspects of interest prohibition. We attempt to lay down some aspects of interest prohibition theory wrapped in a larger framework of informal logic.
Bergstra, J. A., Middelburg, C. A.
core +1 more source
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [PDF]
, 2006 We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of
A. Arnold +25 more
core +2 more sources